译文：
题目描述
升级版的Light Out，是一个五行六列的开关矩阵。每一个开关控制一盏灯。每单按动一个开关，ta以及ta周围的灯（至多4盏，上下左右）就会变成当前状态的相反状态 (如果是开着的，按动开关后就会关闭，如果是关着的，按动开关后就会打开) 四个角上的开关控制3盏灯;位于边上的开关控制4盏灯，其余的开关都控制5盏灯。例如，如果左边状态下，按动标记X的开关，就会呈现出右边的状态。
游戏的目标就是, 从任意状态开始，按动开关使得所有灯都关上. 当相邻的按钮被按下时，一个按钮的影响就会抵消另一个按钮的影响。例如，在下图中，在左边的状态下按下标有X的按钮将呈现出右图。注意，第2列第3行和第2行第5行中的按钮都改变了第2列第4列中的灯的状态，因此，它的状态没有改变。
注意:
1.开关按动的顺序无关紧要
2. 如果按动同一个开关的二次，ta造成的影响和初始状态是一样的，所以没有必要按动同一个开关两次I
3. 正如第二张图所示，第一行中的所有灯都可以通过按第二行对应的按钮关闭。重复这个过程，前四行中的所有等都有可能被关上。类似地，按动第2,3列的开关,所有的灯都可能被关掉。
编写一个程序解决这个问题
输入
第一行是一个正整数n，表示测试点的数量。
每一个测试点都是五行，每一行都有六个0或1，两个元素之间被一个或多个空格分开。0表示灯是关闭的，而1表示灯是打开的。
输出
对于每一个测试点，输出由一行字符串:“PUZZLE #m”，其中m是输入文件中的测试点的编号。之后是一个类似于测试点的输出(与输入的格式相同)。1表示必须按下这个按钮才能解决这个问题，而0表示没有按下按钮。每两个元素之间应该有一个空格。
样例输入
2
0 1 1 0 1 0
1 0 0 1 1 1
0 0 1 0 0 1
1 0 0 1 0 1
0 1 1 1 0 0
0 0 1 0 1 0
1 0 1 0 1 1
0 0 1 0 1 1
1 0 1 1 0 0
0 1 0 1 0 0
样例输出
PUZZLE #1
1 0 1 0 0 1
1 1 0 1 0 1
0 0 1 0 1 1
1 0 0 1 0 0
0 1 0 0 0 0
PUZZLE #2
1 0 0 1 1 1
1 1 0 0 0 0
0 0 0 1 0 0
1 1 0 1 0 1
1 0 1 1 0 1
原文：
Description
In an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light. When a button is pressed, that button and each of its (up to four) neighbors above, below, right and left, has the state of its light reversed. (If on, the light is turned off; if off, the light is turned on.) Buttons in the corners change the state of 3 buttons; buttons on an edge change the state of 4 buttons and other buttons change the state of 5. For example, if the buttons marked X on the left below were to be pressed,the display would change to the image on the right.
The aim of the game is, starting from any initial set of lights on in the display, to press buttons to get the display to a state where all lights are off. When adjacent buttons are pressed, the action of one button can undo the effect of another. For instance, in the display below, pressing buttons marked X in the left display results in the right display.Note that the buttons in row 2 column 3 and row 2 column 5 both change the state of the button in row 2 column 4,so that, in the end, its state is unchanged.
Note:
1. It does not matter what order the buttons are pressed.
2. If a button is pressed a second time, it exactly cancels the effect of the first press, so no button ever need be pressed more than once.
3. As illustrated in the second diagram, all the lights in the first row may be turned off, by pressing the corresponding buttons in the second row. By repeating this process in each row, all the lights in the first
four rows may be turned out. Similarly, by pressing buttons in columns 2, 3 ?, all lights in the first 5 columns may be turned off.
Write a program to solve the puzzle.
Input
The first line of the input is a positive integer n which is the number of puzzles that follow. Each puzzle will be five lines, each of which has six 0 or 1 separated by one or more spaces. A 0 indicates that the light is off, while a 1 indicates that the light is on initially.
Output
For each puzzle, the output consists of a line with the string: “PUZZLE #m”, where m is the index of the puzzle in the input file. Following that line, is a puzzle-like display (in the same format as the input) . In this case, 1’s indicate buttons that must be pressed to solve the puzzle, while 0 indicate buttons, which are not pressed. There should be exactly one space between each 0 or 1 in the output puzzle-like display.
Sample Input
2
0 1 1 0 1 0
1 0 0 1 1 1
0 0 1 0 0 1
1 0 0 1 0 1
0 1 1 1 0 0
0 0 1 0 1 0
1 0 1 0 1 1
0 0 1 0 1 1
1 0 1 1 0 0
0 1 0 1 0 0
Sample Output
PUZZLE #1
1 0 1 0 0 1
1 1 0 1 0 1
0 0 1 0 1 1
1 0 0 1 0 0
0 1 0 0 0 0
PUZZLE #2
1 0 0 1 1 1
1 1 0 0 0 0
0 0 0 1 0 0
1 1 0 1 0 1
1 0 1 1 0 1