# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287943 | tqbfjotld | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 256 ms | 7040 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<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++){
fl.push_back(x&-x);
}
int cur = 0;
for (int x = 0; x<(1<<n); x++){
seq.push_back(cur);
//printf("pushed %d\n",cur);
if (x>=fl.size()){
cur^=fl[x-fl.size()];
}
else cur ^= fl[x];
}
int num = 0;
for (int x = 0; x<n; x++){
char c;
num<<=1;
scanf(" %c",&c);
num += c-'0';
}
int stpos = -1;
for (int x = 0; x<seq.size(); x++){
if (seq[x]==num){
stpos = x;
}
}
assert(stpos!=-1);
printf("%d\n",1<<n);
for (int x = 0; x<(1<<n); x++){
for (int y = n-1; y>=0; y--){
if (seq[(x+stpos)%seq.size()]&(1<<y)){
printf("1");
}
else printf("0");
}
printf("\n");
}
}
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... |