#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++)
{
for(int j = 0;j < n;j++) for(int k = j+1;k < n;k++) for(int l = k+1;l < n;l++)
{
int t = s^(1 << j)^(1 << k)^(1 << l);
if(!used[t]){ 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 |
1 |
Incorrect |
0 ms |
384 KB |
The values in the output sequence are not pairwise distinct! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
The values in the output sequence are not pairwise distinct! |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
12 ms |
512 KB |
Found solution while it does not exist |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
717 ms |
5852 KB |
The values in the output sequence are not pairwise distinct! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
384 KB |
The values in the output sequence are not pairwise distinct! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
731 ms |
5796 KB |
The values in the output sequence are not pairwise distinct! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
717 ms |
5852 KB |
The values in the output sequence are not pairwise distinct! |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
320 ms |
2932 KB |
The values in the output sequence are not pairwise distinct! |
2 |
Halted |
0 ms |
0 KB |
- |