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];
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++)
{
bool br = false;
for(int j = 0;j < n;j++) if(!br) for(int k = j+1;k < n;k++) if(!br) for(int l = k+1;l < n;l++)
{
int t = s^(1 << j)^(1 << k)^(1 << l);
if(!used[t]){ br = true; s = t; break; }
}
used[s] = true;
for(int j = 0;j < n;j++) cout << (bool)((1 << j)&s);
cout << '\n';
}
}
# | 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... |