1949.cpp

来自「浙大acm在线评判系统zju online judge上面的题目解答源码（1）」· C++ 代码 · 共 40 行

#include<iostream.h>
#include<string.h>
int main()
{
  int a[101];
  int total,n;
  int flag,f,fl,t1,t2,f2,k;
  while(cin>>n&&n!=0)
  {     flag=0;f=0;fl=0;
     t1=-1;t2=-1;f2=0;
    memset(a,0,sizeof(a));
    for(int i=0;i<n;i++)
     {
       total=0;
       for(int j=0;j<n;j++)
       { cin>>k;
         a[j]+=k;
         total+=k;
       }
      if(!flag&&total%2!=0) {flag=1;t1=i;}
        else if(flag&&total%2!=0) f=1;
       // cout<<"Corrupt"<<endl;break;};
     }
    // if(f) continue;
     
     for(int i=0;i<n;i++)
      { if(!fl&&a[i]%2!=0)  {fl=1;t2=i;}
          else if(fl&&a[i]%2!=0) f2=1;
         // cout<<"Corrupt"<<endl;break;};
        }
      //  if(f2) continue;
        
       if(t1==-1&&t2==-1) {cout<<"OK"<<endl;continue;}
         else if((t1==-1||t2==-1)||f2||f) {cout<<"Corrupt"<<endl;continue;}
           else cout<<"Change bit ("<<t1+1<<","<<t2+1<<")"<<endl;          
         
     }
      return 0;
    }