| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 15268 |
2015-07-12T05:07:10 Z |
ainta |
분배 (kriii3_Q) |
C++ |
|
16 ms |
3140 KB |
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int n, K;
vector<int>E[65536];
int main()
{
scanf("%d%d",&n,&K);
int i, j, cnt = 0;
for(i=0;i<(1<<K);i++){
for(j=0;j<(1<<n-K-1);j++){
E[i].push_back(cnt);
cnt++;
}
}
cnt = (1<<n);
for(i=0;i<(1<<K);i++){
for(j=0;j<(1<<n-K-1);j++){
cnt--;
E[i].push_back(cnt);
}
}
for(i=0;i<(1<<K);i++){
for(j=0;j<E[i].size();j++)printf("%d ",E[i][j]);
printf("\n");
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 8 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 9 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 11 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 12 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 13 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 14 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 15 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 16 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 17 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 18 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 19 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 20 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 21 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 22 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 23 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 24 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 25 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 26 |
Correct |
2 ms |
2744 KB |
Output is correct |
| 27 |
Correct |
2 ms |
2744 KB |
Output is correct |
| 28 |
Correct |
1 ms |
2744 KB |
Output is correct |
| 29 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 30 |
Correct |
0 ms |
2744 KB |
Output is correct |
| 31 |
Correct |
4 ms |
2744 KB |
Output is correct |
| 32 |
Correct |
4 ms |
2744 KB |
Output is correct |
| 33 |
Correct |
8 ms |
2876 KB |
Output is correct |
| 34 |
Correct |
6 ms |
2888 KB |
Output is correct |
| 35 |
Correct |
2 ms |
2876 KB |
Output is correct |
| 36 |
Correct |
5 ms |
2876 KB |
Output is correct |
| 37 |
Correct |
8 ms |
2880 KB |
Output is correct |
| 38 |
Correct |
0 ms |
2876 KB |
Output is correct |
| 39 |
Correct |
0 ms |
3008 KB |
Output is correct |
| 40 |
Correct |
16 ms |
3140 KB |
Output is correct |
