1949.cpp

2^x mod n = 1 acm竞赛题 Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input

#include<iostream>
using namespace std;
int main()
{
    int n;
    while(cin>>n&&n)
    {
        int a[n][n],bi[n],bj[n],bii=0,bjj=0,weizhii,weizhij;
        for(int i=0;i<n;++i)
            bi[i]=bj[i]=0;
        for(int i=0;i<n;++i)
        for(int j=0;j<n;++j)
            cin>>a[i][j];
        for(int i=0;i<n;++i)
        for(int j=0;j<n;++j)
            bi[i]+=a[i][j];
        for(int i=0;i<n;++i)
        for(int j=0;j<n;++j)
            bj[i]+=a[j][i];
        //cout<<bi[1]<<bj[1]<<endl;
        for(int j=0;j<n;++j)
        {
            if(bi[j]%2!=0){++bii;weizhii=j;}
            if(bj[j]%2!=0){++bjj;weizhij=j;}
        }
        if(bii==0&&bjj==0)
        cout<<"OK"<<endl;
        else if(bii==1&&bjj==1)
        {
            cout<<"Change bit ("<<weizhii+1<<','<<weizhij+1<<')'<<endl;
        }
        else
        cout<<"Corrupt"<<endl;
    }
}