30 人解决，119 人已尝试。
38 份提交通过，共有 401 份提交。
6.9 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
You are given a 7-by-7 board of holes. Some holes are filled with pegs, and some are not. You may jump a peg over an adjacent peg, as long as the hole the jumping peg lands in is unoccupied. The jumped peg is removed. Your goal is to leave the board with only one peg in it, and the peg must end up in the specified location. The board is specified as a 7-by-7 array of characters, with the following meanings:
For example, consider the following board:
x x e e e x x
x x o e e x x
e e o e e e e
e e o O e e e
e e e e e e e
x x e e e x x
x x e e e x x
You can see that there are initially 4 pegs in the board, and the last peg should end up in the middle of the board.
The winning sequence of moves is:
Where coordinates are given as (x, y).
The first line of input is the number of datasets to follow. Each dataset should be processed the same.
The input for each dataset consists of 7 lines; each line consists of 7 characters from the set {x, e, o, E, O} with blanks between them. You are guaranteed that exactly one ‘E’ or ‘O’ will appear, and that two or more ‘o’ or ‘O’ will appear.
For each dataset, output a line containing the data set number. If a sequence of valid moves exists that leaves only one peg on the board, and leaves that peg in the desired location, print out the sequence of moves, as shown in the above example. If no sequence exists, print No solution. Leave a blank line between datasets.
2 x x e e e x x x x o e e x x e e o e e e e e e o O e e e e e e e e e e x x e e e x x x x e e e x x x x e E e e e x e e e e e e e e e o o e e e e e x e e e e e e e e e e e e e e e e e e e e e e e e
Dataset 1: 1. (4, 4) to (2, 4) 2. (3, 2) to (3, 4) 3. (2, 4) to (4, 4) Dataset 2: No solution.
30 人解决，119 人已尝试。
38 份提交通过，共有 401 份提交。
6.9 EMB 奖励。