| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 291054 | Autoratch | "The Lyuboyn" code (IZhO19_lyuboyn) | C++14 | 1091 ms | 5752 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;
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)
| # | 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... | ||||
