# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
15198 |
2015-07-12T03:41:06 Z |
myungwoo |
분배 (kriii3_Q) |
C++14 |
|
0 ms |
1084 KB |
#include<stdio.h>
int main()
{
int N, K;
scanf("%d%d", &N, &K);
for(int i = 0; i < 1<<N-1; i++){
if( i&((1<<N-K-1)-1) );
else printf("\n");
printf("%d %d ", i, ((1<<N)-1)^i);
}
return 0;
}
/*
20000 20000 200 500 500
0 0 0 0 0
20000 20000 200 500 500
20000 20000 200 500 500
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1084 KB |
Output is correct |
2 |
Correct |
0 ms |
1084 KB |
Output is correct |
3 |
Correct |
0 ms |
1084 KB |
Output is correct |
4 |
Correct |
0 ms |
1084 KB |
Output is correct |
5 |
Correct |
0 ms |
1084 KB |
Output is correct |
6 |
Correct |
0 ms |
1084 KB |
Output is correct |
7 |
Correct |
0 ms |
1084 KB |
Output is correct |
8 |
Correct |
0 ms |
1084 KB |
Output is correct |
9 |
Correct |
0 ms |
1084 KB |
Output is correct |
10 |
Correct |
0 ms |
1084 KB |
Output is correct |
11 |
Correct |
0 ms |
1084 KB |
Output is correct |
12 |
Correct |
0 ms |
1084 KB |
Output is correct |
13 |
Correct |
0 ms |
1084 KB |
Output is correct |
14 |
Correct |
0 ms |
1084 KB |
Output is correct |
15 |
Correct |
0 ms |
1084 KB |
Output is correct |
16 |
Correct |
0 ms |
1084 KB |
Output is correct |
17 |
Correct |
0 ms |
1084 KB |
Output is correct |
18 |
Correct |
0 ms |
1084 KB |
Output is correct |
19 |
Correct |
0 ms |
1084 KB |
Output is correct |
20 |
Correct |
0 ms |
1084 KB |
Output is correct |
21 |
Correct |
0 ms |
1084 KB |
Output is correct |
22 |
Correct |
0 ms |
1084 KB |
Output is correct |
23 |
Correct |
0 ms |
1084 KB |
Output is correct |
24 |
Correct |
0 ms |
1084 KB |
Output is correct |
25 |
Correct |
0 ms |
1084 KB |
Output is correct |
26 |
Correct |
0 ms |
1084 KB |
Output is correct |
27 |
Correct |
0 ms |
1084 KB |
Output is correct |
28 |
Correct |
0 ms |
1084 KB |
Output is correct |
29 |
Correct |
0 ms |
1084 KB |
Output is correct |
30 |
Correct |
0 ms |
1084 KB |
Output is correct |
31 |
Correct |
0 ms |
1084 KB |
Output is correct |
32 |
Correct |
0 ms |
1084 KB |
Output is correct |
33 |
Correct |
0 ms |
1084 KB |
Output is correct |
34 |
Correct |
0 ms |
1084 KB |
Output is correct |
35 |
Correct |
0 ms |
1084 KB |
Output is correct |
36 |
Correct |
0 ms |
1084 KB |
Output is correct |
37 |
Correct |
0 ms |
1084 KB |
Output is correct |
38 |
Correct |
0 ms |
1084 KB |
Output is correct |
39 |
Correct |
0 ms |
1084 KB |
Output is correct |
40 |
Correct |
0 ms |
1084 KB |
Output is correct |