Error Correction

Error Correction

时间: 1ms        内存:64M

描述:

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.

输入:

The input file 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.

输出:

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".

示例输入:

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

示例输出:

OK
Change bit (2,3)
Corrupt

提示:

参考答案(内存最优[752]):

#include<stdio.h>
int main()
{
    int i,j,k,t,v;
    int w,m,n;
    int h[110],l[110];
    int a[110][110];
    for(i=0;; i++)
    {
        m=n=0;
        t=v=0;
        for(i=0; i<100; i++)
        {
            l[i]=-1;
            h[i]=-1;
        }
        scanf("%d",&w);
        if(w==0)
            break;
        for(j=0; j<w; j++)
            for(k=0; k<w; k++)
                scanf("%d",&a[j][k]);
        for(i=0; i<w; i++)
        {
            m=n=0;
            for(j=0; j<w; j++)
            {
                m=a[i][j]+m;
                n=a[j][i]+n;
            }

            if(m%2!=0)
            {
                h[t]=i;
                t++;
            }
            if(n%2!=0)
            {
                l[v]=i;
                v++;
            }
        }
        if(l[0]==-1&&h[0]==-1)
            printf("OK\n");
        else if(l[0]!=-1&&l[1]==-1&&(h[0]!=-1&&h[1]==-1))
            printf("Change bit (%d,%d)\n",h[0]+1,l[0]+1);
        else
            printf("Corrupt\n");

    }
    return 0;
}

参考答案(时间最优[4]):

#include <stdio.h>
int s[101][101];
int main()
{
    int n;
    while(scanf("%d",&n)&&n){
        int i,j;
        int rsum[101]={0};
        int csum[101]={0};
        for(i=0;i<n;++i){
            for(j=0;j<n;++j){
                scanf("%d",&s[i][j]);
                rsum[i]+=s[i][j];
                csum[j]+=s[i][j];
            }
        }
        int cr=0,cc=0,countr,countc;
        for(i=0;i<n;++i){
            if(rsum[i]&1){
                cr++;
                countr=i;
            }
            if(csum[i]&1){
                cc++;
                countc=i;
            }
        }
        if(cr==0&&cc==0)printf("OK\n");
        else if(cr==1&&cc==1)printf("Change bit (%d,%d)\n",countr+1,countc+1);
        else printf("Corrupt\n");
    }
    return 0;
}

题目和答案均来自于互联网,仅供参考,如有问题请联系管理员修改或删除。

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注