-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathN과 M (11).java
51 lines (40 loc) · 1.21 KB
/
N과 M (11).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
import java.util.*;
import java.io.*;
public class Main {
static int N;
static int M;
static int[] arr = new int[9];
static int[] num;
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());
num = new int[N];
st = new StringTokenizer(br.readLine());
for(int i = 0; i < N; i++){
num[i] = Integer.parseInt(st.nextToken());
}
Arrays.sort(num);
bt(0);
System.out.print(sb);
}
static void bt(int k){
if(k == M){
for(int i = 0; i < M; i++){
sb.append(arr[i]+" ");
}
sb.append("\n");
return;
}
int before = 0;
for(int i = 0; i < N; i++){
if(before != num[i]){
before = num[i];
arr[k] = num[i];
bt(k+1);
}
}
}
}