# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146198 | imeimi2000 | "The Lyuboyn" code (IZhO19_lyuboyn) | C++17 | 242 ms | 5392 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
char _S[20];
int B[1 << 18];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n, k, t;
cin >> n >> k >> t >> _S;
if (k + 1 & 1) {
printf("-1\n");
return 0;
}
int S = 0;
for (int i = 0; i < n; ++i) S = S << 1 | _S[i] - '0';
for (int i = 0; i <= k; ++i)
B[1 << i] = (1 << k + 1) - (1 << i) - 1;
for (int i = k + 1; i < n; ++i)
B[1 << i] = (1 << k - 1) + (1 << i) - 1;
printf("%d\n", 1 << n);
for (int i = 0; i < (1 << n); ++i) {
S ^= B[i & -i];
for (int j = n; j--; ) printf("%c", ((S >> j) & 1) + '0');
printf("\n");
}
return 0;
}
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... |