POJ 2260

#include <iostream>
#define MAXN 100
using namespace std;

int _m[MAXN][MAXN];

int main()
{
    //freopen("acm.acm","r",stdin);
    int i;
    int j;
    int n;
    int sum;
    int code_r;
    int code_c;
    while(cin>>n,n)
    {
        code_r = -1;
        code_c = -1;
        for(i = 0; i < n; ++ i)
        {
            for(j = 0; j < n; ++ j)
            {
                cin>>_m[i][j];
            }
        }


        for(i = 0; i < n; ++ i)
        {
            sum = 0;
            for(j = 0; j < n; ++ j)
            {
                sum += _m[i][j];
            }
            if(sum % 2 != 0)
            {
                if(code_r == -1)
                    code_r = i;
                else
                {
                    code_r = -2;
                    break;
                }
            }
            if(code_r == -2)
                break;
        }

        if(code_r == -2)
        {
            cout<<"Corrupt"<<endl;
            continue;
        }
    
        for(j = 0; j < n; ++ j)
        {
            sum = 0;
            for(i = 0; i < n; ++ i)
            {
                sum += _m[i][j];
            }
            if(sum % 2 != 0)
            {
                if(code_c == -1)
                {
                    code_c = j;
                }
                else
                {
                    code_c = -2;
                    break;
                }
            }
        }
        if(code_c == -2)
        {
            cout<<"Corrupt"<<endl;
            continue;
        }
        
        if(code_r == -1 && code_c == -1)
        {
            cout<<"OK"<<endl;
        }
        else
        {
            cout<<"Change bit ("<<code_r+1<<","<<code_c+1<<")"<<endl;
        }

    }
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。 

技术网站地址： vmfor.com