Uva227 Puzzle 谜题 (java版本)
来源:互联网 发布:在淘宝上怎样买东西 编辑:程序博客网 时间:2024/06/18 11:20
Puzzle
Time limit: 3.000 seconds
A children's puzzle that was popular 30 years ago consisted of a 5x5 frame which contained 24 small squares of equal size. A unique letter of the alphabet was printed on each small square. Since there were only 24 squares within the frame, the frame also contained an empty position which was the same size as a small square. A square could be moved into that empty position if it were immediately to the right, to the left, above, or below the empty position. The object of the puzzle was to slide squares into the empty position so that the frame displayed the letters in alphabetical order.
The illustration below represents a puzzle in its original configuration and in its configuration after the following sequence of 6 moves:
1) The square above the empty position moves.
2) The square to the right of the empty position moves.
3) The square to the right of the empty position moves.
4) The square below the empty position moves.
5) The square below the empty position moves.
6) The square to the left of the empty position moves.
Write a program to display resulting frames given their initial configurations and sequences of moves.
Input
Input for your program consists of several puzzles. Each is described by its initial configuration and the sequence of moves on the puzzle. The first 5 lines of each puzzle description are the starting configuration. Subsequent lines give the sequence of moves.
The first line of the frame display corresponds to the top line of squares in the puzzle. The other lines follow in order. The empty position in a frame is indicated by a blank. Each display line contains exactly 5 characters, beginning with the character on the leftmost square (or a blank if the leftmost square is actually the empty frame position). The display lines will correspond to a legitimate puzzle.
The sequence of moves is represented by a sequence of As, Bs, Rs, and Ls to denote which square moves into the empty position. A denotes that the square above the empty position moves; B denotes that the square below the empty position moves; L denotes that the square to the left of the empty position moves; R denotes that the square to the right of the empty position moves. It is possible that there is an illegal move, even when it is represented by one of the 4 move characters. If an illegal move occurs, the puzzle is considered to have no final configuration. This sequence of moves may be spread over several lines, but it always ends in the digit 0. The end of data is denoted by the character Z.
Output
Output for each puzzle begins with an appropriately labeled number (Puzzle #1, Puzzle #2, etc.). If the puzzle has no final configuration, then a message to that effect should follow. Otherwise that final configuration should be displayed.
Format each line for a final configuration so that there is a single blank character between two adjacent letters. Treat the empty square the same as a letter. For example, if the blank is an interior position, then it will appear as a sequence of 3 blanks - one to separate it from the square to the left, one for the empty position itself, and one to separate it from the square to the right.
Separate output from different puzzle records by one blank line.
Note: The first record of the sample input corresponds to the puzzle illustrated above.
Sample Input
TRGSJXDOKIM VLNWPABEUQHCFARRBBL0ABCDEFGHIJKLMNOPQRS TUVWXAAALLLL0ABCDEFGHIJKLMNOPQRS TUVWXAAAAABBRRRLL0Z
Sample Output
Puzzle #1:T R G S JX O K L IM D V B NW P A EU Q H C FPuzzle #2: A B C DF G H I EK L M N JP Q R S OT U V W XPuzzle #3:This puzzle has no final configuration.
提示:我只写了入门书上那个方块的一个例子,其他的同理。
import java.util.Scanner;public class UVa227 {public static void main(String[] args) {char[][] c = new char[][] { { 'T', 'R', 'G', 'S', 'J' }, { 'X', 'D', 'O', 'K', 'I' },{ 'M', ' ', 'V', 'L', 'N' }, { 'W', 'P', 'A', 'B', 'E' }, { 'U', 'Q', 'H', 'C', 'F' }, };int m = 2;int n = 1;Boolean f = true;Scanner in = new Scanner(System.in);String s = in.nextLine();char[] c1 = s.toCharArray();for (int i = 0; i < s.length(); i++) {switch (c1[i]) {case 'A':if (m - 1 >= 0) {c[m][n] = c[--m][n];c[m][n] = ' ';} else {f = false;}break;case 'B':if (m + 1 <= 4) {c[m][n] = c[++m][n];c[m][n] = ' ';} else {f = false;}break;case 'L':if (n - 1 >= 0) {c[m][n] = c[m][--n];c[m][n] = ' ';} else {f = false;}break;case 'R':if (n + 1 <= 4) {c[m][n] = c[m][++n];c[m][n] = ' ';} else {f = false;}break;}}if (f) {for (int i = 0; i < 5; i++) {for (int j = 0; j < 5; j++) {System.out.print(c[i][j]);}System.out.println();}} elseSystem.out.println("This puzzle has no final configuration.");}}
- Uva227 Puzzle 谜题 (java版本)
- UVa227 谜题 Puzzle
- 谜题(Puzzle UVa227)
- Uva227-Puzzle-谜题
- UVa227 Puzzle——C++版本
- Uva227 - Puzzle
- Uva227.Puzzle
- UVA227-Puzzle
- UVa227 Puzzle
- uva227 - Puzzle
- Puzzle,UVa227
- uva227 - Puzzle
- [UVA227]Puzzle
- UVA227 puzzle
- UVa227 Puzzle
- UVA227 Puzzle
- UVa227 Puzzle
- UVa227:Puzzle
- 搜素框的制作
- LeetCode学习篇一——Counting Bits
- [LeetCode] 131. Palindrome Partitioning
- (转)解决VS2010链接错误:LINK : fatal error LNK1123: 转换到 COFF 期间失败: 文件无效或损坏
- Binder机制(非常好理解)
- Uva227 Puzzle 谜题 (java版本)
- eclipse maven+mybatis+web项目(一)
- Context——Context的使用
- PATB1028:人口普查
- 磁盘分区
- 新的开始
- Angular2学习笔记-环境搭建
- 51nod 1099 任务执行顺序
- PATB1009:说反话