#P3240. Solution to the <i>n</i><sup>2</sup> − 1 Puzzle

    ID: 2250 远端评测题 1000ms 128MiB 尝试: 0 已通过: 0 难度: (无) 上传者: 标签>POJ Monthly--2007.06.03, Huang, Jinsong

Solution to the <i>n</i><sup>2</sup> − 1 Puzzle

Description

In addition to the eight queen puzzle, another famous puzzle that has also been generalized is the fifteen puzzle. For a puzzle of size n × n, natural numbers below n2 are placed into squares leaving one empty. The puzzle is solved by sliding the squares until it looks similar to that shown in the figure below. Given the starting configuration, you are to find a solution or report that no solution exists.

Input

The input contains exactly one test case. The first line of input contains n (n ≤ 10). The next n2 numbers describe the puzzle by rows. The empty square is represented by zero.

Output

If no solution exists, just print “No Answer!”. Otherwise print a string consisting of the letters “L” (left), “R” (right), “U” (up), “D” (down) showing how the empty square moves to solve the puzzle.

2
3 1
2 0
LURD

Source

POJ Monthly--2007.06.03, Huang, Jinsong