[백준] 15656번 N과 M (7)

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

15656번: N과 M (7)

 

중복을 제거할 필요 없으므로 방문 체크 로직 제거

 

import java.util.*;
import java.io.*;

public class Main {

    public static int N, M;
    public static int[] ans;
    public static int[] arr;
    public static StringBuffer sb = new StringBuffer();

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        N = Integer.parseInt(st.nextToken()); // 자연수 개수
        M = Integer.parseInt(st.nextToken()); // 자연수
        ans = new int[M];
        arr = new int[N];

        st = new StringTokenizer(br.readLine());
        for (int i = 0; i < N; i++) {
        	arr[i] = Integer.parseInt(st.nextToken());
        }
        Arrays.sort(arr);
        dfs(0);
        System.out.println(sb);

    }

    private static void dfs(int depth) {
        if(depth == M) {
            for(int val : ans) {
            	sb.append(val).append(" ");
            }
            sb.append("\n");
            return;
        }

        for(int i = 0 ; i < N; i ++) {
        	ans[depth] = arr[i];
        	dfs(depth + 1);
        }

    }
}