| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 15462 |
2015-07-12T08:03:21 Z |
pichulia |
분배 (kriii3_Q) |
C++ |
|
8 ms |
1596 KB |
#include<stdio.h>
#include<algorithm>
using namespace std;
int n, m;
long long int p[1<<16];
int main()
{
scanf("%d %d",&n,&m);
int i, j;
long long int k = 1<<m;
k = 2*k-1;
for(i=0;i<(1<<m);i++)
{
long long int kk = k - i;
int tt=0;
for(j=0; j<(1<<(n-m-1)); j++)
{
if(tt==0)tt=1;else printf(" ");
printf("%d",(i<<(n-m-1)) + j);
if(tt==0)tt=1;else printf(" ");
printf("%d",(kk<<(n-m-1)) + j);
}
printf("\n");
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 2 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 3 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 4 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 5 |
Correct |
0 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 |
0 ms |
1596 KB |
Output is correct |
| 11 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 12 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 13 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 14 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 15 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 16 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 17 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 18 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 19 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 20 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 21 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 22 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 23 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 24 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 25 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 26 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 27 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 28 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 29 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 30 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 31 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 32 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 33 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 34 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 35 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 36 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 37 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 38 |
Correct |
0 ms |
1596 KB |
Output is correct |
| 39 |
Correct |
8 ms |
1596 KB |
Output is correct |
| 40 |
Correct |
0 ms |
1596 KB |
Output is correct |
