# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288113 | tqbfjotld | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 350 ms | 20964 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 <bits/stdc++.h>
using namespace std;
vector<int> seq;
vector<vector<int> > fl;
int main(){
int n,k,t;
scanf("%d%d%d",&n,&k,&t);
if (k%2==0){
printf("-1");
return 0;
}
for (int x = 1; x<=(1<<n)/2; x++){
vector<int> to;
if ((x&-x)>(1<<k)){
to.push_back(x&-x);
for (int x = 0; x<k-1; x++){
to.push_back(1<<(x+1));
}
}
else{
int T = 0;
for (int X = 1; X<=(1<<k); X<<=1){
if (X!=(x&-x)){
to.push_back(X);
T++;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |