Error Correction-2260

Error Correction

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 5941		Accepted: 3839

Description

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. 

Input

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

Output

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

Sample Input

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

Sample Output

OK
Change bit (2,3)
Corrupt

Source

/***********************************************************************
    Copyright (c) 2015,wangzp
    All rights no reserved.
  
    Name: 《Error Correction》In PEKING UNIVERSITY ACM
    ID:   PROBLEM 2260
    问题简述: 0和1组成的方阵，如果行与列的和都是偶数，则OK；
              如果有一行和一列的和都不是偶数，可以通过0变1或者1变0使之变为OK；
              如果进行调整不可以满足条件，则Corrupt。
    Date: Aug 12, 2015 
 
***********************************************************************/
#include 
   
   
    
    
int main(void)
{
	int n;
	int a[100][100],b[100],c[100];
	int i,j,flag_x,flag_y,sum_x,sum_y;
	while (scanf("%d",&n),n != 0)
	{
		for (i = 0;i < n;i++)
		{
			for (j = 0; j < n;j++)
			{
				scanf("%d",&a[i][j]);
			}
		}
		

		/*按行计算查看计算结果*/
		for (i = 0;i < n;i++)
		{
			b[i] = 0;
			for (j = 0;j < n;j++)
			{
				b[i] += a[i][j];
			}
		}

		/*按列统计*/
		for (i = 0;i < n;i++)
		{
			c[i] = 0;
			for (j = 0;j < n;j++)
			{
				c[i] += a[j][i];
			}
		}


		/*核心算法*/
		sum_x = 0;
		sum_y = 0;
		flag_x = 0;
		flag_y = 0;

		for (i = 0;i < n;i++)
		{
			if ((b[i] % 2 != 0))
			{
				sum_x++;
				flag_x = i;
			}
		}
		for (j = 0;j < n;j++)
		{
			if ((c[j] % 2 != 0))
			{
				sum_y++;
				flag_y = j;
			}
		}
		/*输出处理*/
		if ((sum_x > 1) || (sum_y > 1))
		{
			
			printf("Corrupt\n");
		} 
		else if ((sum_x == 0) && (sum_y == 0))
		{
			printf("OK\n");
		}
		else
		{
			printf("Change bit (%d,%d)\n",flag_x + 1,flag_y + 1);
		}
	}
	return 0;
}