| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 15203 | gs14004 | 분배 (kriii3_Q) | C++14 | 8 ms | 1736 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 <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 |
|---|---|---|---|---|
| Fetching results... | ||||