# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15181 | xhae | 분배 (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>
#include <set>
#include <algorithm>
using namespace std;
set<int> remain[20];
int main(){
int n,K;
scanf("%d%d",&n,&K);
int num = 0;
for (int i = 0; i < (1<<K); i++) {
for (int j = 0; j < (1<<(n-K)); j += 2) {
printf("%d %d%s",num, (1<<n)-1-num, (j+2 < (1<<(n-K))) ? " " : "\n");
num++;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |