Submission #287887

#TimeUsernameProblemLanguageResultExecution timeMemory
287887dvdg6566"The Lyuboyn" code (IZhO19_lyuboyn)C++14
11 / 100
73 ms7992 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> pi; typedef vector<ll> vi; typedef vector<pi> vpi; #define pb emplace_back #define mp make_pair #define f first #define s second #define SZ(x) (int)x.size() #define ALL(x) x.begin(),x.end() #define lb lower_bound const int MAXN=1001000; const ll MOD=998244353; vi V; int N,K,T,S; void tobin(int y){ string x; while(y){ x+=('0' + y%2); y/=2; } while(SZ(x) <N)x+='0'; reverse(ALL(x)); cout<<x<<'\n'; } int main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>N>>K>>T>>S; assert(S==0); assert(K==1); V.pb(0); for(int i=0;i<N;++i){ stack<int> tm; for(auto i:V)tm.push(i); while(SZ(tm)){ V.pb(tm.top() | (1<<i)); tm.pop(); } } cout<<(1<<N)<<'\n'; for(auto i:V){ tobin(i); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...