답안 #15189

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15189 2015-07-12T03:33:04 Z hodduc 분배 (kriii3_Q) C++
0 / 24
7 ms 1340 KB
#include<stdio.h>
int N, K;
long long n[17];
int vn[65536];
int main()
{
        n[1] = 1;
        for(long long i = 2, x = 2; i < 16; i++, x<<=1){
                n[i] = n[i-1] * 2 + x;
        }
        for(int i = 1; i < 65536; i<<=1) {
                for(int j = 0; j < 65536; 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;

        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 1 ms 1340 KB Output is correct
2 Correct 0 ms 1340 KB Output is correct
3 Correct 0 ms 1340 KB Output is correct
4 Correct 0 ms 1340 KB Output is correct
5 Correct 1 ms 1340 KB Output is correct
6 Correct 0 ms 1340 KB Output is correct
7 Correct 0 ms 1340 KB Output is correct
8 Correct 1 ms 1340 KB Output is correct
9 Correct 0 ms 1340 KB Output is correct
10 Correct 0 ms 1340 KB Output is correct
11 Correct 1 ms 1340 KB Output is correct
12 Correct 0 ms 1340 KB Output is correct
13 Correct 0 ms 1340 KB Output is correct
14 Correct 0 ms 1340 KB Output is correct
15 Correct 0 ms 1340 KB Output is correct
16 Correct 0 ms 1340 KB Output is correct
17 Correct 1 ms 1340 KB Output is correct
18 Correct 0 ms 1340 KB Output is correct
19 Correct 0 ms 1340 KB Output is correct
20 Correct 1 ms 1340 KB Output is correct
21 Correct 0 ms 1340 KB Output is correct
22 Correct 0 ms 1340 KB Output is correct
23 Correct 0 ms 1340 KB Output is correct
24 Correct 0 ms 1340 KB Output is correct
25 Correct 2 ms 1340 KB Output is correct
26 Correct 0 ms 1340 KB Output is correct
27 Correct 0 ms 1340 KB Output is correct
28 Correct 0 ms 1340 KB Output is correct
29 Correct 0 ms 1340 KB Output is correct
30 Correct 4 ms 1340 KB Output is correct
31 Correct 0 ms 1340 KB Output is correct
32 Correct 4 ms 1340 KB Output is correct
33 Correct 7 ms 1340 KB Output is correct
34 Correct 7 ms 1340 KB Output is correct
35 Correct 0 ms 1340 KB Output is correct
36 Correct 4 ms 1340 KB Output is correct
37 Incorrect 0 ms 1340 KB Output isn't correct
38 Halted 0 ms 0 KB -