forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
53 lines (45 loc) · 1.43 KB
/
A.cpp
File metadata and controls
53 lines (45 loc) · 1.43 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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; ++i)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; --i)
#define REP(i,a) for(int i=0,_a=(a); i < _a; ++i)
#define DEBUG(X) { cout << #X << " = " << X << endl; }
#define PR(A,n) { cout << #A << " = "; FOR(_,1,n) cout << A[_] << ' '; cout << endl; }
#define PR0(A,n) { cout << #A << " = "; REP(_,n) cout << A[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
#define SZ(x) ((int) (x).size())
using namespace std;
const int MN = 1011;
char a[MN][MN];
int n;
bool check() {
FOR(i,1,n) FOR(j,i+1,n)
if (a[i][j] == '-') {
bool ok = false;
FOR(k,1,n) if (a[i][k] + a[j][k] == '1' + '2') {
ok = true;
break;
}
if (!ok) return false;
}
return true;
}
int main() {
ios :: sync_with_stdio(0); cin.tie(0);
freopen("avia.in", "r", stdin);
freopen("avia.out", "w", stdout);
while (scanf("%d\n", &n) == 1) {
FOR(i,1,n) scanf("%s\n", &a[i][1]);
while (true) {
FOR(i,1,n) FOR(j,1,n)
if (a[i][j] != '-') a[i][j] = a[j][i] = rand() % 2 + '1';
if (check()) {
FOR(i,1,n) {
FOR(j,1,n) cout << a[i][j];
cout << '\n';
}
break;
}
}
}
}