# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
15192 |
2015-07-12T03:36:26 Z |
hodduc |
분배 (kriii3_Q) |
C++ |
|
11 ms |
1596 KB |
#include<stdio.h>
int N, K;
long long n[18];
int vn[131072];
int main()
{
n[1] = 1;
for(long long i = 2, x = 2; i < 17; i++, x<<=1){
n[i] = n[i-1] * 2 + x;
}
for(int i = 1; i < 131072; i<<=1) {
for(int j = 0; j < 131072; j++)
{
if(j&i) vn[j]++;
}
}
long long l, t, j, bn;
scanf("%d %d", &N, &K);
l = 1 << K;
t = n[N] / l;
j = 0;
bn = (1 << N) - 1;
if(n[N] % l != 0) {
printf("ERR?");
return 0;
}
for(int i = 0; i < l; i++)
{
long long tt = t;
while(tt) {
printf("%lld ", j);
printf("%lld ", bn-j);
tt -= vn[j];
tt -= vn[bn-j];
j++;
}
printf("\n");
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
1596 KB |
Output is correct |
2 |
Correct |
3 ms |
1596 KB |
Output is correct |
3 |
Correct |
3 ms |
1596 KB |
Output is correct |
4 |
Correct |
3 ms |
1596 KB |
Output is correct |
5 |
Correct |
3 ms |
1596 KB |
Output is correct |
6 |
Correct |
0 ms |
1596 KB |
Output is correct |
7 |
Correct |
0 ms |
1596 KB |
Output is correct |
8 |
Correct |
0 ms |
1596 KB |
Output is correct |
9 |
Correct |
0 ms |
1596 KB |
Output is correct |
10 |
Correct |
3 ms |
1596 KB |
Output is correct |
11 |
Correct |
0 ms |
1596 KB |
Output is correct |
12 |
Correct |
3 ms |
1596 KB |
Output is correct |
13 |
Correct |
3 ms |
1596 KB |
Output is correct |
14 |
Correct |
3 ms |
1596 KB |
Output is correct |
15 |
Correct |
3 ms |
1596 KB |
Output is correct |
16 |
Correct |
3 ms |
1596 KB |
Output is correct |
17 |
Correct |
3 ms |
1596 KB |
Output is correct |
18 |
Correct |
0 ms |
1596 KB |
Output is correct |
19 |
Correct |
3 ms |
1596 KB |
Output is correct |
20 |
Correct |
3 ms |
1596 KB |
Output is correct |
21 |
Correct |
3 ms |
1596 KB |
Output is correct |
22 |
Correct |
3 ms |
1596 KB |
Output is correct |
23 |
Correct |
3 ms |
1596 KB |
Output is correct |
24 |
Correct |
3 ms |
1596 KB |
Output is correct |
25 |
Correct |
3 ms |
1596 KB |
Output is correct |
26 |
Correct |
0 ms |
1596 KB |
Output is correct |
27 |
Correct |
4 ms |
1596 KB |
Output is correct |
28 |
Correct |
3 ms |
1596 KB |
Output is correct |
29 |
Correct |
4 ms |
1596 KB |
Output is correct |
30 |
Correct |
4 ms |
1596 KB |
Output is correct |
31 |
Correct |
5 ms |
1596 KB |
Output is correct |
32 |
Correct |
5 ms |
1596 KB |
Output is correct |
33 |
Correct |
4 ms |
1596 KB |
Output is correct |
34 |
Correct |
0 ms |
1596 KB |
Output is correct |
35 |
Correct |
8 ms |
1596 KB |
Output is correct |
36 |
Correct |
7 ms |
1596 KB |
Output is correct |
37 |
Correct |
9 ms |
1596 KB |
Output is correct |
38 |
Correct |
0 ms |
1596 KB |
Output is correct |
39 |
Correct |
11 ms |
1596 KB |
Output is correct |
40 |
Correct |
7 ms |
1596 KB |
Output is correct |