POJ2260 ZOJ1949 UVA541 Error Correction【水题】

Error Correction

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7020		Accepted: 4399

Description

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

Source

Ulm Local 1998

 

问题链接：POJ2260 ZOJ1949 UVA541 Error Correction

问题描述：（略）

问题分析：

  这是一个奇偶均势矩阵判断问题。

  读入矩阵的同时，统计一下各行各列之和，然后再统计一下，就可以进行判断处理了。如果行和列和为奇数的都只有1个，那就找到奇异点，否则就没有。

程序说明：（略）

参考链接：（略）

题记：（略）

 

AC的C++语言程序如下：

/* POJ2260 ZOJ1949 UVA541 Error Correction */

#include <iostream>
#include <stdio.h>
#include <string.h>

using namespace std;

const int N = 100;
int a[N][N], rowsum[N], colsum[N];

int main()
{
    int n;
    while(~scanf("%d", &n) && n) {
        memset(rowsum, 0, sizeof(rowsum));
        memset(colsum, 0, sizeof(colsum));

        // 读入数据和求和
        for(int i = 0; i < n; i++)
            for(int j = 0; j < n; j++) {
                scanf("%d", &a[i][j]);
                rowsum[i] += a[i][j];
                colsum[j] += a[i][j];
            }

        // 计算：基数行列和为奇数的数量，并记住奇异点坐标
        int rcnt = 0, ccnt = 0, row, col;
        for(int i = 0; i < n; i++) {
            if(rowsum[i] % 2)
                rcnt++, row = i;
            if(colsum[i] % 2)
                ccnt++, col = i;
        }

        // 输出结果
        if(rcnt > 1 || ccnt > 1)
            printf("Corrupt\n");
        else if(rcnt == 0 && ccnt == 0)
            printf("OK\n");
        else
            printf("Change bit (%d,%d)\n", row + 1, col + 1);
    }

    return 0;
}