Uva 227-Puzzle

Puzzle 
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

 

TRGSJ
XDOKI
M VLN
WPABE
UQHCF
ARRBBL0
ABCDE
FGHIJ
KLMNO
PQRS 
TUVWX
AAA
LLLL0
ABCDE
FGHIJ
KLMNO
PQRS 
TUVWX
AAAAABBRRRLL0
Z
 

Sample Output

 

Puzzle #1:
T R G S J
X O K L I
M D V B N
W P   A E
U Q H C F

Puzzle #2:
  A B C D
F G H I E
K L M N J
P Q R S O
T U V W X

Puzzle #3:
This puzzle has no final configuration.

题目

 

这道题改了好久好久，很多细节没做好，注意字符的读取和非法内存的访问
1.先是wrong answer,因为非法标志每组数据处理完后没有初始化
2.再来是runtime error,因为访问了不明内存，我输入非法指令并没有处理让它执行了移动操作，后来我把它改成非法就退出指令循环，又出现新的错误，指令字符没有全部读完还在输入流中进入下一组数据输入，最后完善为若非法则直接读取全部指令
3.presentation error,因为每行字符结尾多输出了一个空格
4.输入每一行后面有一个换行符'\n'，不要把它读进数组里
5.别忘了逐次输入完指令后有一个'\n'在输入流中
6.不足是运行时间太长，用常量数组来做应该会快一点

  1 #include <iostream>
  2 
  3 using namespace std;
  4 
  5 int main()
  6 {
  7     char a[5][5], o  = ' ';                                      //o为输入命令
  8     int p = -1, q = -1, Count = 0, valid = 0,one = 0;           //p为行坐标，q为列坐标,valid为非法标记
  9     while(1)
 10     {
 11         ++Count;
 12         valid = 0;                                                //1.标记合法
 13         for(int i = 0; i < 5; i++)
 14         {    //输入
 15          for(int j = 0; j < 5; j ++)
 16          {
 17              cin >> noskipws >> a[i][j];
 18              if(a[0][0] == 'Z')
 19                 return 0;
 20              if(a[i][j] == ' ')
 21              {
 22                  p = i;
 23                  q = j;
 24              }
 25          }
 26                       cin.get();        //4.每输入一行，吸收一个换行符，一开始放到二层循环里去了
 27         }
 28 
 29 //----------------------------------------------------------------------------------------------------------
 30         do
 31         {                   //移动
 32             cin >> o;
 33             switch(o)
 34             {
 35              case 'A':
 36                 if(p == 0)
 37                  {
 38                   valid = 1;
 39                   break;
 40                  }
 41                 a[p][q] = a[p-1][q];
 42                 a[--p][q] = ' ';
 43                 break;
 44              case 'B':
 45                 if(p == 4)
 46                 {
 47                     valid = 1;
 48                     break;
 49                 }
 50                 a[p][q] = a[p+1][q];
 51                 a[++p][q] = ' ';
 52                 break;
 53              case 'L':
 54                  if(q == 0)
 55                  {
 56                      valid = 1;
 57                      break;
 58                  }
 59                 a[p][q] = a[p][q-1];
 60                 a[p][--q] = ' ';
 61                 break;
 62              case 'R':
 63                  if(q == 4)
 64                  {
 65                      valid = 4;
 66                      break;
 67                  }
 68                 a[p][q] = a[p][q+1];
 69                 a[p][++q] = ' ';
 70                 break;
 71              default:
 72                 break;
 73             }
 74             //if(p < 0 || p > 4 || q < 0 || q > 4)
 75                // valid = 1;                     //非法标记
 76             if(valid)
 77             {                                    //2.非法直接读取剩余指令，退出指令循环，避免访问不明内存
 78                 while(o != '0')
 79                     cin >> o;
 80                 break;
 81             }
 82         }while(o != '0');
 83        84  //--------------------------------------------------------------------------------------------------------------------
 85         if(one) cout << endl;
 86         else one = 1;
 87         cin.get();                            //5.卧槽
 88         cout << "Puzzle #" << Count << ":" << endl;
 89         if(!valid)
 90         {
 91            for(int i = 0; i < 5; i++)
 92            {                                  //输出
 93               for(int j = 0; j < 5; j++)
 94               {
 95                 cout << a[i][j] ;
 96                 if(j < 4)  cout << ' ';       //3
 97               }
 98                  cout << endl;
 99            }
100         }
101         else
102             cout << "This puzzle has no final configuration." ;
103 
104     }
105     return 0;
106 
107 }

 

 

转载于:https://www.cnblogs.com/ekinzhang/p/4280118.html