|
| 1 | +package Simulation.jo1037; |
| 2 | + |
| 3 | +import java.io.BufferedReader; |
| 4 | +import java.io.FileInputStream; |
| 5 | +import java.io.InputStreamReader; |
| 6 | +import java.util.StringTokenizer; |
| 7 | + |
| 8 | +public class Main { |
| 9 | + |
| 10 | + static int N; |
| 11 | + static int[][] map; |
| 12 | + |
| 13 | + public static void main(String[] args) throws Exception { |
| 14 | + System.setIn(new FileInputStream("src/Simulation/jo1037/input.txt")); |
| 15 | + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); |
| 16 | + StringTokenizer st; |
| 17 | + |
| 18 | + N = Integer.parseInt(br.readLine()); |
| 19 | + map = new int[N][N]; |
| 20 | + |
| 21 | + for (int i = 0; i < N; i++) { |
| 22 | + st = new StringTokenizer(br.readLine()); |
| 23 | + for (int j = 0; j < N; j++) { |
| 24 | + map[i][j] = Integer.parseInt(st.nextToken()); |
| 25 | + } |
| 26 | + } |
| 27 | + |
| 28 | + if (isParity()) System.out.println("OK"); |
| 29 | + else chageBit(); |
| 30 | + |
| 31 | + } |
| 32 | + |
| 33 | + static void chageBit() { |
| 34 | + for (int i = 0; i < N; i++) { |
| 35 | + for (int j = 0; j < N; j++) { |
| 36 | + map[i][j] = 1 - map[i][j]; |
| 37 | + if (isParity()) { |
| 38 | + System.out.println("Change bit (" + (i+1) + "," + (j+1) + ")"); |
| 39 | + return; |
| 40 | + } |
| 41 | + map[i][j] = 1 - map[i][j]; |
| 42 | + } |
| 43 | + } |
| 44 | + |
| 45 | + System.out.println("Corrupt"); |
| 46 | + } |
| 47 | + |
| 48 | + static boolean isParity() { |
| 49 | + int rCnt = 0, cCnt = 0; |
| 50 | + for (int i = 0; i < N; i++) { |
| 51 | + for (int j = 0; j < N; j++) { |
| 52 | + rCnt += map[i][j]; |
| 53 | + cCnt += map[j][i]; |
| 54 | + } |
| 55 | + if (rCnt%2 != 0 || cCnt%2 != 0) return false; |
| 56 | + } |
| 57 | + |
| 58 | + return true; |
| 59 | + } |
| 60 | +} |
0 commit comments