-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path15664.java
61 lines (42 loc) · 1.16 KB
/
15664.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
55
56
57
58
59
60
61
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
arr = new int[n];
check = new boolean[n];
set = new HashSet<>();
for(int i=0; i<n; i++) {
arr[i] = sc.nextInt();
}
Arrays.sort(arr);
go(new int[m], 0, 0);
}
static int[] arr;
static boolean[] check;
static HashSet<String> set;
static String convert(int[] sel) {
StringBuilder sb = new StringBuilder();
for(int i=0; i<sel.length; i++) {
sb.append(sel[i]);
sb.append(" ");
}
return sb.toString();
}
static void go(int[] sel, int sel_idx, int arr_idx) {
if(sel_idx == sel.length) {
String str = convert(sel);
if(!set.contains(str)) {
set.add(str);
System.out.println(str);
}
return;
}
if(arr_idx == arr.length)
return;
sel[sel_idx] = arr[arr_idx];
go(sel, sel_idx+1, arr_idx+1);
go(sel, sel_idx, arr_idx+1);
}
}