#include<stdio.h>
#include<vector>
int pow(int n, int k) {
if (k == 0) {
return 1;
}
int temp = pow(n, k / 2);
if (k % 2 == 0) {
return temp*temp;
}
return temp*temp*n;
}
std::vector<int> vec[65537];
int arr[65536];
int main() {
int n, k;
scanf("%d%d", &n, &k);
int N, K;
N = pow(2, n) - 1;
K = pow(2, k);
int temp = pow(2, n - k-1);
int cnt = 0;
for (int i = 0; i < temp; i++) {
for (int j = 1; j <= K; j++) {
vec[j].push_back(cnt++);
}
for (int j = K; j >=1; j--) {
vec[j].push_back(cnt++);
}
}
for (int i = 1; i <= K; i++) {
for (std::vector<int>::iterator it = vec[i].begin(); it != vec[i].end(); it++) {
printf("%d ", *it);
}
printf("\n");
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 4 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 5 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 6 |
Correct |
1 ms |
3000 KB |
Output is correct |
| 7 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 8 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 9 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 10 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 11 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 12 |
Correct |
1 ms |
3000 KB |
Output is correct |
| 13 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 14 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 15 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 16 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 17 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 18 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 19 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 20 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 21 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 22 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 23 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 24 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 25 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 26 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 27 |
Correct |
1 ms |
3000 KB |
Output is correct |
| 28 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 29 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 30 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 31 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 32 |
Correct |
0 ms |
3000 KB |
Output is correct |
| 33 |
Correct |
0 ms |
3132 KB |
Output is correct |
| 34 |
Correct |
0 ms |
3160 KB |
Output is correct |
| 35 |
Correct |
0 ms |
3132 KB |
Output is correct |
| 36 |
Correct |
0 ms |
3132 KB |
Output is correct |
| 37 |
Correct |
2 ms |
3276 KB |
Output is correct |
| 38 |
Correct |
12 ms |
3268 KB |
Output is correct |
| 39 |
Correct |
9 ms |
3264 KB |
Output is correct |
| 40 |
Correct |
16 ms |
3396 KB |
Output is correct |
