import java.util.Scanner;
public class Main
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
while (true)
{
int n = sc.nextInt();
if (n == 0)
break;
int[][] matrix = new int[n][n];
int row = -1;
boolean isCorrupt = false;
for (int i = 0; i < n; i++)
{
int sum = 0;
for (int j = 0; j < n; j++)
{
int m = sc.nextInt();
matrix[i][j] = m;
sum += m;
}
if (sum % 2 != 0)
if (row == -1)
row = i;
else
isCorrupt = true;
}
int column = -1;
for (int j = 0; j < n; j++)
{
int sum = 0;
for (int i = 0; i < n; i++)
sum += matrix[i][j];
if (sum % 2 != 0)
if (column == -1)
column = j;
else
isCorrupt = true;
}
if (row == -1 && column == -1)
System.out.println("OK");
else if (isCorrupt)
System.out.println("Corrupt");
else
System.out.format("Change bit (%d,%d)\n", row + 1, column + 1);
}
}
}
ZOJ-1949
最新推荐文章于 2019-06-23 21:05:26 发布