# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15174 | progressive | 분배 (kriii3_Q) | C++14 | 9 ms | 1084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
int main()
{
int K,N;
scanf("%d%d",&N,&K);
int tot=1<<K;
int dist=1<<(N-K-1);
int top=0;
int bot=(1<<N)-1;
for(int i=0;i<tot;i++)
{
for(int j=top;j<top+dist;j++)
printf("%d ",j);
for(int j=bot;j>bot-dist;j--)
printf("%d ",j);
puts("");
top+=dist;
bot-=dist;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |