Submission #291054

#TimeUsernameProblemLanguageResultExecution timeMemory
291054Autoratch"The Lyuboyn" code (IZhO19_lyuboyn)C++14
5 / 100
1091 ms5752 KiB
#include <bits/stdc++.h> using namespace std; const int N = 1<< 18; int n,k,t,s; string ss; bool used[N]; set<int> r; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k >> t >> ss; for(int i = 0;i < n;i++) if(ss[i]=='1') s+=(1 << i); cout << (1 << n) << '\n' << ss << '\n'; used[s] = true; for(int i = 1;i < (1 << n);i++) { while(true) { r.clear(); while(r.size()<k) r.insert(rand()%n); int t = s; for(int x : r) t^=(1 << x); if(!used[t]){ s = t; break; } } used[s] = true; for(int j = 0;j < n;j++) cout << (bool)((1 << j)&s); cout << '\n'; } }

Compilation message (stderr)

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:24:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |    while(r.size()<k) r.insert(rand()%n);
      |          ~~~~~~~~^~
#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...