# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336380 | 2020-12-15T06:01:46 Z | beksultan04 | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 54 ms | 10312 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> #define OK puts("OK"); #define fr first #define sc second #define ret return #define scan1(a) scanf("%lld",&a); #define scan2(a,b) scanf("%lld %lld",&a, &b); #define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c); #define all(s) s.begin(),s.end() #define pb push_back #define sz(v) (int)v.size() #define endi puts(""); const int N = 5e5+12,INF=1e9+7; int q[N]; main(){ int n,k,t,i,j; scan3(n,k,t) if (k%2==0){ cout <<-1; ret 0; } vector <string> v; for (i=0;i<(1<<n);++i){ string s=""; for (j=0;n>=(1<<j);++j){ if (i&(1<<j))s+='1'; else s+='0'; } v.pb(s); } cout <<v.size()<<"\n"; for (i=0;i<v.size()/2;++i)cout <<v[i]<<"\n"; for (i=v.size()-1;i>=v.size()/2;--i)cout <<v[i]<<"\n"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | First number in answer is not x 1 0 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Expected EOLN |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 364 KB | Ok |
2 | Correct | 0 ms | 364 KB | Ok |
3 | Correct | 1 ms | 364 KB | Ok |
4 | Correct | 1 ms | 364 KB | Ok |
5 | Correct | 1 ms | 364 KB | Ok |
6 | Correct | 1 ms | 364 KB | Ok |
7 | Correct | 1 ms | 384 KB | Ok |
8 | Correct | 1 ms | 364 KB | Ok |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 53 ms | 10312 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 364 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 54 ms | 10184 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 53 ms | 10312 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 26 ms | 5436 KB | Expected EOLN |
2 | Halted | 0 ms | 0 KB | - |