UVA 541 Error Correction【水题】

时间：2016-05-12 22:23:56 阅读：156 评论：0 收藏：0 [点我收藏+]

Error Correction

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 1 Accepted Submission(s) : 1

Problem 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:

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

Sample Output

OK
Change bit (2,3)
Corrupt

#include<stdio.h>
#include<string.h>
int main (void)
{
    int a;
    while(scanf("%d",&a)!=EOF&&a!=0)
    {
        int b[101][101];
        int c[1010],d[1010];
        memset(b,0,sizeof(b));
        memset(c,0,sizeof(c));
        memset(d,0,sizeof(d));
        for(int i=0; i<a; i++)
        {
            for(int ii=0; ii<a; ii++)
            {
                scanf("%d",&b[i][ii]);
                c[i]=b[i][ii]+c[i];
            }
        }
        for(int i=0; i<a; i++)
        {
            for(int ii=0; ii<a; ii++)
            {
                d[i]+=b[ii][i];
            }
        }
        int k=0,kk=0;
        int end=0;
        int x,y;
        for(int i=0; i<a; i++)
        {
            if(c[i]%2==1)
            {
                k++;
                x=i;
            }
            if(d[i]%2==1)
            {
                kk++;
                y=i;
            }
            if(k==2||kk==2)
            {
                printf("Corrupt\n");
                end=1;
                break;
            }
        }
        if(k==0&&kk==0)
        {
            printf("OK\n");
        }
        if(k==1&&kk==1)
        {
            printf("Change bit (%d,%d)\n",x+1,y+1);
        }
    }
    return 0;
}

UVA 541 Error Correction【水题】

原文：http://blog.csdn.net/qq_24653023/article/details/51353640

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年09月23日 (328)
2021年09月24日 (313)
2021年09月17日 (191)
2021年09月15日 (369)
2021年09月16日 (411)
2021年09月13日 (439)
2021年09月11日 (398)
2021年09月12日 (393)
2021年09月10日 (160)
2021年09月08日 (222)