| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 15181 |
2015-07-12T03:23:21 Z |
xhae |
분배 (kriii3_Q) |
C++14 |
|
9 ms |
1084 KB |
#include <cstdio>
#include <set>
#include <algorithm>
using namespace std;
set<int> remain[20];
int main(){
int n,K;
scanf("%d%d",&n,&K);
int num = 0;
for (int i = 0; i < (1<<K); i++) {
for (int j = 0; j < (1<<(n-K)); j += 2) {
printf("%d %d%s",num, (1<<n)-1-num, (j+2 < (1<<(n-K))) ? " " : "\n");
num++;
}
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
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 |
2 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 |
2 ms |
1084 KB |
Output is correct |
| 32 |
Correct |
3 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 |
3 ms |
1084 KB |
Output is correct |
| 37 |
Correct |
9 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 |
9 ms |
1084 KB |
Output is correct |
