| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15203 |
2015-07-12T03:46:22 Z |
gs14004 |
분배 (kriii3_Q) |
C++14 |
|
8 ms |
1736 KB |
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
using namespace std;
typedef long long lint;
lint bino[44][44];
int main(){
int n, k;
scanf("%d %d",&n,&k);
int pt = 0;
for(int i=0; i<(1<<k); i++){
for(int j=0; j<(1<<(n-k-1)); j++){
printf("%d %d ",pt,((1<<n) - 1) ^ pt);
pt++;
}
puts("");
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 5 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 6 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 7 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 8 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 9 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 10 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 27 |
Correct |
1 ms |
1736 KB |
Output is correct |
| 28 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 29 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 30 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 31 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 32 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 33 |
Correct |
4 ms |
1736 KB |
Output is correct |
| 34 |
Correct |
4 ms |
1736 KB |
Output is correct |
| 35 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 36 |
Correct |
3 ms |
1736 KB |
Output is correct |
| 37 |
Correct |
8 ms |
1736 KB |
Output is correct |
| 38 |
Correct |
8 ms |
1736 KB |
Output is correct |
| 39 |
Correct |
0 ms |
1736 KB |
Output is correct |
| 40 |
Correct |
4 ms |
1736 KB |
Output is correct |
