| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15251 |
2015-07-12T04:36:53 Z |
kyma123 |
분배 (kriii3_Q) |
C++ |
|
27 ms |
1112 KB |
#include <stdio.h>
#include <vector>
#include <math.h>
using namespace std;
vector<int> num;
int main(){
int n, k;
scanf("%d %d",&n, &k);
for(int i=0;i<powf(2,k);i++){
for(int j=0;j<powf(2,n-k-1);j++){
printf("%d ", i*(int)powf(2,n-k-1)+j);
printf("%d ", (int)powf(2,n)-1-i*(int)powf(2,n-k-1)-j);
}
putchar('\n');
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 21 |
Correct |
1 ms |
1112 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
2 ms |
1112 KB |
Output is correct |
| 25 |
Correct |
1 ms |
1112 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 27 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 28 |
Correct |
3 ms |
1112 KB |
Output is correct |
| 29 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 30 |
Correct |
5 ms |
1112 KB |
Output is correct |
| 31 |
Correct |
6 ms |
1112 KB |
Output is correct |
| 32 |
Correct |
6 ms |
1112 KB |
Output is correct |
| 33 |
Correct |
0 ms |
1112 KB |
Output is correct |
| 34 |
Correct |
14 ms |
1112 KB |
Output is correct |
| 35 |
Correct |
9 ms |
1112 KB |
Output is correct |
| 36 |
Correct |
13 ms |
1112 KB |
Output is correct |
| 37 |
Correct |
26 ms |
1112 KB |
Output is correct |
| 38 |
Correct |
25 ms |
1112 KB |
Output is correct |
| 39 |
Correct |
27 ms |
1112 KB |
Output is correct |
| 40 |
Correct |
0 ms |
1112 KB |
Output is correct |
