Error Correction pku 2260

题目出处：pku 2260  http://acm.pku.edu.cn/JudgeOnline/problem?id=2260

               joj  1322  http://acm.jlu.edu.cn/joj/showproblem.php?pid=1322

 

解题：

 

import java.util.ArrayList; import java.util.Scanner; public class Main { public static void main(String[] args){ Scanner cin = new Scanner(System.in); while(true) { int matrixSize = cin.nextInt(); if (matrixSize == 0) { break; } int matrix[][] = new int[matrixSize][matrixSize]; for (int i = 0; i < matrixSize; i++) { for (int j = 0; j < matrixSize; j++) { matrix[i][j] = cin.nextInt(); } } ArrayList<Integer> iIndexList = new ArrayList<Integer>(); ArrayList<Integer> jIndexList = new ArrayList<Integer>(); for (int i = 0; i < matrixSize; i++) { int sumI = 0; int sumJ = 0; for (int j = 0; j < matrixSize; j++) { sumI += matrix[i][j]; sumJ += matrix[j][i]; } if (sumI % 2 != 0) { iIndexList.add(i); } if (sumJ % 2 != 0) { jIndexList.add(i); } } if (iIndexList.size() == 0 && jIndexList.size() == 0) { System.out.println("OK"); } else if (iIndexList.size() == 1 && jIndexList.size() == 1) { System.out.println("Change bit (" + (iIndexList.get(0)+1) + "," + (jIndexList.get(0)+1) + ")"); } else { System.out.println("Corrupt"); } } } }

 

只是有一点我觉得可以修改的地方 便是不用加号来求出和数，而是采用取异或的方式来求和