当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3240:Solution to the n2 − 1 Puzzle

Special Judge 特殊评判
题目描述

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.

输入解释

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.

输出解释

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

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-3240

最后修改于 2020-10-29T06:56:35+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 131072