import java.util.Scanner;
public class Guandeng {
public static void main(String[] args) {
int[][] array = {
{ 0, 0, 1, 0, 0 },
{ 0, 1, 1, 1, 0 },
{ 0, 0, 1, 0, 0 },
{ 0, 0, 0, 0, 0 }
};
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array[i].length; j++) {
System.out.print(array[i][j] + " ");
}
System.out.println();
}
Scanner scanner = new Scanner(System.in);
int sum = 0;
do {
System.out.println("请输入行");
int c = scanner.nextInt();
System.out.println("请输入列");
int r = scanner.nextInt();
array[r][c] = 1 - array[r][c];
if (r - 1 >= 0) {
array[r - 1][c] = 1 - array[r - 1][c];
}
if (r + 1 <= array.length) {
array[r + 1][c] = 1 - array[r+1][c];
}
if (c - 1 >= 0) {
array[r][c - 1] = 1 - array[r][c - 1];
}
if (c + 1 <= array.length) {
array[r][c + 1] = 1 - array[r][c + 1];
}
sum = 0;
for (int i = 0; i < array.length; i++) {
for (int j = 0; j < array[i].length; j++) {
sum = sum + array[i][j];
System.out.print(array[i][j] + " ");
}
System.out.println( );
}
} while (sum != 0);
System.out.println("恭喜过关");
}
}