| Task: | Even Grid |
| Sender: | ind1f |
| Submission time: | 2025-11-26 17:34:56 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.00 s | details |
| #10 | ACCEPTED | 0.00 s | details |
| #11 | ACCEPTED | 0.00 s | details |
Code
#include <iostream>
const int N = 1e2 + 5;
int n;
char a[N][N];
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cin >> n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
std::cin >> a[i][j];
}
}
for (int i = 2; i <= n - 1; i++) {
for (int j = 2; j <= n - 1; j++) {
a[i][j] = '0';
}
}
for (int j = 2; j <= n - 1; j++) {
a[n][j] = a[1][j];
}
for (int i = 2; i <= n - 1; i++) {
a[i][n] = a[i][1];
}
int x = 0;
for (int i = 1; i <= n - 1; i++) {
x ^= (a[i][n] - '0');
}
a[n][n] = (char)(x + '0');
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
std::cout << a[i][j];
}
std::cout << '\n';
}
return 0;
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 2 11 1? |
| correct output |
|---|
| 11 11 |
| user output |
|---|
| 11 11 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 3 101 1?? 0?? |
| correct output |
|---|
| 101 101 000 |
| user output |
|---|
| 101 101 000 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 4 1010 0??? 1??? 0??? |
| correct output |
|---|
| 1010 0000 1010 0000 |
| user output |
|---|
| 1010 0000 1001 0011 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 5 11101 1???? 1???? 1???? ... |
| correct output |
|---|
| 11101 11101 11101 11101 00000 |
| user output |
|---|
| 11101 10001 10001 10001 01100 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 5 10111 1???? 1???? 0???? ... |
| correct output |
|---|
| 10111 10111 10111 00000 10111 |
| user output |
|---|
| 10111 10001 10001 00000 10111 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 5 11000 0???? 0???? 0???? ... |
| correct output |
|---|
| 11000 00000 00000 00000 11000 |
| user output |
|---|
| 11000 00000 00000 00000 11000 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 5 10100 1???? 0???? 1???? ... |
| correct output |
|---|
| 10100 10100 00000 10100 10100 |
| user output |
|---|
| 10100 10001 00000 10001 10100 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 5 10100 1???? 1???? 0???? ... |
| correct output |
|---|
| 10100 10100 10100 00000 10100 |
| user output |
|---|
| 10100 10001 10001 00000 10100 |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 10 1010000000 1????????? 0????????? 0????????? ... |
| correct output |
|---|
| 1010000000 1010000000 0000000000 0000000000 0000000000 ... |
| user output |
|---|
| 1010000000 1000000001 0000000000 0000000000 0000000000 ... |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 100 100010110100011000001111001110... |
| correct output |
|---|
| 100010110100011000001111001110... |
| user output |
|---|
| 100010110100011000001111001110... |
Test 11
Verdict: ACCEPTED
| input |
|---|
| 100 100100110000010110111101111101... |
| correct output |
|---|
| 100100110000010110111101111101... |
| user output |
|---|
| 100100110000010110111101111101... |
