-
Notifications
You must be signed in to change notification settings - Fork 2
/
Main.java
49 lines (40 loc) Β· 1.3 KB
/
Main.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
package Series.NandM.P15657;
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main {
static int N, M;
static int[] nums;
static int[] ans = new int[8];
static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
public static void main(String[] args) throws Exception{
// System.setIn(new FileInputStream("src/Series/NandM/input.txt"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());
M = Integer.parseInt(st.nextToken());
nums = new int[N];
st = new StringTokenizer(br.readLine());
for (int i = 0; i < N; i++) {
nums[i] = Integer.parseInt(st.nextToken());
}
Arrays.sort(nums);
dfs(0, 0);
br.close();
bw.flush();
bw.close();
}
static void dfs(int count, int last) throws IOException {
if (count == M) {
for (int i = 0; i < M; i++) {
bw.write(ans[i] + " ");
}
bw.newLine();
return;
}
for (int i = last; i < N; i++) {
ans[count] = nums[i];
dfs(count + 1, i);
}
}
}