-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathboj_15654.java
54 lines (46 loc) · 1.39 KB
/
boj_15654.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
package backtracking;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class boj_15654 {
static int N,M;
static int[] arr;
static boolean[] visit;
static int[] result;
static StringBuilder sb=new StringBuilder();
public static void main(String[] args) throws IOException {
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st=new StringTokenizer(br.readLine());
N=Integer.parseInt(st.nextToken());
M=Integer.parseInt(st.nextToken());
arr=new int[N];
visit=new boolean[N];
result=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
dfs(0,0);
System.out.println(sb);
}
private static void dfs(int start,int depth){
if (depth==M){
for(int i=0;i<M;i++){
sb.append(result[i]+" ");
}
sb.append("\n");
return;
}
for(int i=0;i<N;i++){
if(!visit[i]){
visit[i]=true;
result[depth]=arr[i];
dfs(start,depth+1);
visit[i]=false;
}
}
}
}