#include <iostream>
#include <cmath>
using namespace std;
int main(void)
{
int N, K, i, j, index, rows, cols, num_len;
int num[65525];
//N = 8, K = 1;
cin >> N;
cin >> K;
// rows, cols 구하기
rows = pow((double)2, K);
num_len = pow((double)2, N);
cols = num_len/rows/2;
// 전체 숫자 구하기
for(i=0; i<num_len; i++) {
num[i] = i;
}
// 상자에 들어갈 수 출력하기
index = 0;
for(i=0; i<rows; ++i) {
for(j=0; j<cols; ++j) {
cout << num[index] << ' ' << num[num_len-1-index];
if (j < cols-1)
cout << ' ';
index++;
}
cout << endl;
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1848 KB |
Output is correct |
2 |
Correct |
0 ms |
1852 KB |
Output is correct |
3 |
Correct |
0 ms |
1848 KB |
Output is correct |
4 |
Correct |
0 ms |
1848 KB |
Output is correct |
5 |
Correct |
0 ms |
1852 KB |
Output is correct |
6 |
Correct |
0 ms |
1856 KB |
Output is correct |
7 |
Correct |
0 ms |
1852 KB |
Output is correct |
8 |
Correct |
0 ms |
1848 KB |
Output is correct |
9 |
Correct |
0 ms |
1848 KB |
Output is correct |
10 |
Correct |
0 ms |
1856 KB |
Output is correct |
11 |
Correct |
0 ms |
1852 KB |
Output is correct |
12 |
Correct |
0 ms |
1856 KB |
Output is correct |
13 |
Correct |
0 ms |
1852 KB |
Output is correct |
14 |
Correct |
0 ms |
1848 KB |
Output is correct |
15 |
Correct |
0 ms |
1848 KB |
Output is correct |
16 |
Correct |
0 ms |
1856 KB |
Output is correct |
17 |
Correct |
0 ms |
1852 KB |
Output is correct |
18 |
Correct |
0 ms |
1852 KB |
Output is correct |
19 |
Correct |
0 ms |
1848 KB |
Output is correct |
20 |
Correct |
0 ms |
1856 KB |
Output is correct |
21 |
Correct |
0 ms |
1848 KB |
Output is correct |
22 |
Correct |
0 ms |
1852 KB |
Output is correct |
23 |
Correct |
0 ms |
1852 KB |
Output is correct |
24 |
Correct |
0 ms |
1856 KB |
Output is correct |
25 |
Correct |
0 ms |
1848 KB |
Output is correct |
26 |
Correct |
4 ms |
1852 KB |
Output is correct |
27 |
Correct |
0 ms |
1848 KB |
Output is correct |
28 |
Correct |
0 ms |
1852 KB |
Output is correct |
29 |
Correct |
8 ms |
1848 KB |
Output is correct |
30 |
Correct |
0 ms |
1848 KB |
Output is correct |
31 |
Correct |
0 ms |
1848 KB |
Output is correct |
32 |
Correct |
0 ms |
1848 KB |
Output is correct |
33 |
Correct |
8 ms |
1852 KB |
Output is correct |
34 |
Correct |
3 ms |
1852 KB |
Output is correct |
35 |
Correct |
5 ms |
1852 KB |
Output is correct |
36 |
Correct |
3 ms |
1848 KB |
Output is correct |
37 |
Correct |
4 ms |
1852 KB |
Output is correct |
38 |
Correct |
5 ms |
1852 KB |
Output is correct |
39 |
Correct |
0 ms |
1852 KB |
Output is correct |
40 |
Correct |
36 ms |
1848 KB |
Output is correct |