# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20224 | 2016-04-22T00:57:35 Z | byrage | 분배 (kriii3_Q) | C | 1 ms | 0 KB |
#include <stdio.h> int main(){ int n,k,i,j,t = 0; scanf("%d%d",&n, &k); for (i = 0; i < (1 << k); i++) { for (j = 0; j < (1 << n - 1); j++) { if (j == (1 << n - 1) / 2 ) { t = (1 << n - i - 1); } printf("%d ", j + t); } t = t >> 1; printf("\n"); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 0 KB | Output is correct |
2 | Correct | 1 ms | 0 KB | Output is correct |
3 | Incorrect | 1 ms | 0 KB | Output isn't correct |