| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 15202 |
2015-07-12T03:45:24 Z |
jeapi |
분배 (kriii3_Q) |
C++ |
|
35 ms |
1756 KB |
#include<iostream>
#include<algorithm>
using namespace std;
int D[10000];
int square(int D){
int T = 1;
for (int i = 1; i < D; i++){
T = T * 2;
}
return T;
}
int main(){
int N, K;
cin >> N >> K;
int W = (1 << (N - K));
N = (1 << N);
K = (1 << K);
for (int j = 0; j < K; j++){
for (int i = 0; i < W; i++){
if (i % 2 == 0)
cout << (((i + 1) / 2)*(K * 2)) + j << ' ';
else
cout << (((i + 1) / 2)*(K * 2)) - j - 1 << ' ';
}
cout << endl;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 25 |
Correct |
1 ms |
1756 KB |
Output is correct |
| 26 |
Correct |
4 ms |
1756 KB |
Output is correct |
| 27 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 28 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 29 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 30 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 31 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 32 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 33 |
Correct |
19 ms |
1756 KB |
Output is correct |
| 34 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 35 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 36 |
Correct |
6 ms |
1756 KB |
Output is correct |
| 37 |
Correct |
0 ms |
1756 KB |
Output is correct |
| 38 |
Correct |
6 ms |
1756 KB |
Output is correct |
| 39 |
Correct |
11 ms |
1756 KB |
Output is correct |
| 40 |
Correct |
35 ms |
1756 KB |
Output is correct |
