1169.cpp

acm acmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacmacm

#include<iostream>
using namespace std;
int main(void)
{
	int i,j,k,d,a1,b1,a[100][100],sum_row[100],sum_column[100];
	while(cin>>d,d)
	{
	 for(i=0;i<d;i++)
		 sum_row[i]=sum_column[i]=0;//初始化
	 for(i=0;i<d;i++)
	    for(j=0;j<d;j++)
			cin>>a[i][j];//输入矩阵
		 for(i=0;i<d;i++)
	    for(j=0;j<d;j++)
		{
		   sum_row[i]+=a[i][j];
		   sum_column[i]+=a[j][i];
		}//求出行和与列和
		/*for(j=0;j<d;j++)
		{
		   cout<<sum_row[j]<<endl;
		   cout<<sum_column[j]<<endl;
		}*/
		     a1=0,b1=0;
			for(i=0;i<d;i++)
			 {
				
		      if(sum_row[i]%2!=0)
				  a1++;
			  if(sum_column[i]%2!=0)
				  b1++;
			 }
		//	cout<<a1<<b1<<endl;
			if(a1==0&&b1==0)
			cout<<"OK"<<endl;
		   else	if((a1==1)&&(b1==1))
			{
		    	for(k=0;k<d;k++)
				{
		            if(sum_row[k]%2!=0)
					{
			    	 i=k+1;
					 break;
					}
				}
			//	cout<<i<<j;
				for(k=0;k<d;k++)
				{
			         if(sum_column[k]%2!=0)
					 {
				     j=k+1;
					 break;
					 }
				}
			   cout<<"Change bit ("<<i<<","<<j<<")"<<endl;

			}

				else cout<<"Corrupt"<<endl;
	
	
	}
		return 0;
}