BEAKJOON JAVA ALGORITHM #6603(로또)

https://www.acmicpc.net/problem/6603

import java.util.ArrayList; import java.util.Scanner; public class a6603 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(true) { int k = sc.nextInt(); if(k == 0) break; int[] s = new int[k]; for(int i=0; i<k; i++) { s[i] = sc.nextInt(); } int[] b = new int[k]; for(int i=0; i<k-6; i++) { b[i] = 0; } for(int i=k-6; i<k; i++) { b[i] = 1; } ArrayList<String> result = new ArrayList<>(); do { StringBuilder sb = new StringBuilder(); boolean[] boo = new boolean[k]; int[] arr = new int[6]; for(int i=0; i<6; i++) { for(int j=0; j<k; j++) { if(boo[j] == false && b[j] == 1) { arr[i] = s[j]; boo[j] = true; break; } } } for(int i=0; i<6; i++) { sb.append(arr[i]).append(" "); } result.add(sb.toString()); }while(nextArr(b)); for(int i=result.size()-1; i>=0; i--) { System.out.println(result.get(i)); } System.out.println(); } } public static boolean nextArr(int[] arr) { int i = arr.length-1; while(i>0 && arr[i-1] >= arr[i]) { i--; } if(i <= 0) { return false; } int j = arr.length-1; while(j >= i && arr[j] <= arr[i-1]) { j--; } int temp = arr[i-1]; arr[i-1] = arr[j]; arr[j] = temp; j = arr.length-1; while(i < j) { temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; i++; j--; } return true; } }