백준 15657번 N과 M (8) [ Java ]

15657번: N과 M (8)

조금만 변형하면 풀리는 문제

import java.util.*;

public class Main {
    static int N, M;
    static int[] num;
    static int[] print;
    static StringBuilder sb = new StringBuilder();

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        N = sc.nextInt();
        M = sc.nextInt();
        num = new int[N];
        print = new int[M];
        for (int i=0; i<N; i++) num[i] = sc.nextInt();
        Arrays.sort(num);
        bt(0, 0);
        System.out.print(sb);
    }
    static void bt(int depth, int start){
        if (depth == M){
            for (int i : print)
                sb.append(i+" ");
            sb.append("\n");
            return;
        }
        for (int i=start; i<N; i++){
            print[depth] = num[i];
            bt(depth + 1, i);
        }
    }
}