-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path1450C1.cpp
More file actions
54 lines (44 loc) · 1.12 KB
/
1450C1.cpp
File metadata and controls
54 lines (44 loc) · 1.12 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ii pair<int, int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define F0R(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define inf 1000000010
int dx[4]{-1,0,1,0};
int dy[4]{0,-1,0,1};
int main() {
cin.tie(0)->sync_with_stdio(0);
int t; cin >> t;
while (t--) {
int n; cin >> n;
char A[n][n]; F0R(i, n) F0R(j, n) cin >> A[i][j];
int num[n][n];
F0R(i, n) F0R(j, n) num[i][j] = -1;
F0R(i, n) {
F0R(j, n) {
if (A[i][j] == 'X') num[i][j] = (i+j)%3;
}
}
int ct[3]{0};
F0R(i, n) {
F0R(j, n) {
if (num[i][j] >= 0) ct[num[i][j]]++;
}
}
int magic = 0;
FOR(i, 1, 3) if (ct[i] < ct[magic]) magic = i;
F0R(i, n) {
F0R(j, n) {
cout << (num[i][j] == magic ? 'O' : A[i][j]);
}
cout << "\n";
}
}
return 0;
}