zoj 1949 Error Correction

Error Correction

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

A boolean matrix has the parity property when each row and each column has an even sum, i.e. contains an even number of bits which are set. Here's a 4 x 4 matrix which has the parity property:

1 0 1 0
0 0 0 0
1 1 1 1
0 1 0 1

The sums of the rows are 2, 0, 4 and 2. The sums of the columns are 2, 2, 2 and 2. 

Your job is to write a program that reads in a matrix and checks if it has the parity property. If not, your program should check if the parity property can be established by changing only one bit. If this is not possible either, the matrix should be classified as corrupt.

Input

The input will contain one or more test cases. The first line of each test case contains one integer n (n < 100), representing the size of the matrix. On the next n lines, there will be n integers per line. No other integers than 0 and 1 will occur in the matrix. Input will be terminated by a value of 0 for n.

Output

For each matrix in the input file, print one line. If the matrix already has the parity property, print "OK". If the parity property can be established by changing one bit, print "Change bit (i,j)" where i is the row and j the column of the bit to be changed. Otherwise, print "Corrupt".

Sample Input

4
1 0 1 0
0 0 0 0
1 1 1 1
0 1 0 1
4
1 0 1 0
0 0 1 0
1 1 1 1
0 1 0 1
4
1 0 1 0
0 1 1 0
1 1 1 1
0 1 0 1
0

Sample Output

OK
Change bit (2,3)
Corrupt

思路：判断行和列的数和是奇数的个数。

1.如果都是0.那么ok

2.如果都是1，那么可以修改一个，使得ok，用一个变量记录数和是奇数所在的行，用一个变量记录数和是奇数所在的列。

最后输出。

3.其他情况都是Corrupt。

 

 1 #include <iostream>
 2 #include <cstdio>
 3 using namespace std;
 4 int main(){
 5     int n;
 6     int i, j;
 7     int NumOfRowOdd, NumOfColOdd, row_index, col_index, sum = 0;
 8     int m[100][100];
 9     while(cin >> n){
10         if(n == 0)
11             break;
12         NumOfColOdd = 0;
13         NumOfRowOdd = 0;
14         for(i = 0; i < n; i++){
15             for(j = 0; j < n; j++){
16                 cin >> m[i][j];
17             }
18         }
19         for(i = 0; i < n; i++){
20             sum = 0;
21             for(j = 0; j < n; j++){
22                 sum += m[i][j];
23             }
24             if(sum % 2 == 1){
25                 NumOfRowOdd++;
26                 row_index = i;
27             }
28         }
29         for(j = 0; j < n; j++){
30             sum = 0;
31             for(i = 0; i < n; i++){
32                 sum += m[i][j];
33             }
34             if(sum % 2 == 1){
35                 NumOfColOdd++;
36                 col_index = j;
37             }
38         }
39         if(NumOfColOdd > 1 || NumOfRowOdd > 1){
40             cout << "Corrupt" << endl;
41             continue;
42         }
43         if(NumOfColOdd == 0 && NumOfRowOdd == 0){
44             cout << "OK" << endl;
45             continue;
46         }
47         printf("Change bit (%d,%d)\n", row_index + 1, col_index + 1);
48     }
49     return 0;
50 }

 

转载于:https://www.cnblogs.com/qinduanyinghua/p/6527114.html