-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathMain.java
60 lines (48 loc) Β· 1.57 KB
/
Main.java
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
55
56
57
58
59
60
package Simulation.jo1037;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static int N;
static int[][] map;
public static void main(String[] args) throws Exception {
System.setIn(new FileInputStream("src/Simulation/jo1037/input.txt"));
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st;
N = Integer.parseInt(br.readLine());
map = new int[N][N];
for (int i = 0; i < N; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < N; j++) {
map[i][j] = Integer.parseInt(st.nextToken());
}
}
if (isParity()) System.out.println("OK");
else chageBit();
}
static void chageBit() {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
map[i][j] = 1 - map[i][j];
if (isParity()) {
System.out.println("Change bit (" + (i+1) + "," + (j+1) + ")");
return;
}
map[i][j] = 1 - map[i][j];
}
}
System.out.println("Corrupt");
}
static boolean isParity() {
int rCnt = 0, cCnt = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
rCnt += map[i][j];
cCnt += map[j][i];
}
if (rCnt%2 != 0 || cCnt%2 != 0) return false;
}
return true;
}
}