2 void cpp1 void_cpp1 于 2016.03.31 18:31 提问

关于ACM中遇到的一些怪问题求解 Uva 227-Puzzle 1C

A children’s puzzle that was popular 30 years ago consisted of a 5×5 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.

以下是我的代码,已AC,但不知道为什么在code:blocks里总是无法正常结束,复制标准输入再到dos界面右键后最后还是有提示输入的光标,enter后才能正常结束。。。。不过中午的时候意外又可以正常结束,现在我优化了以下代码不知道为什么又不行了,跪求各位巨巨解答囧

#include <stdio.h>
#include <string.h>
#include <ctype.h>
//2.#include<stdlib.h>
char str[100];
int main()
{
//    freopen("C:\\Users\\Aliez\\Desktop\\input.txt","r",stdin);
//    freopen("C:\\Users\\Aliez\\Desktop\\output.txt","w",stdout);
    char puz[5][5],temp;
    int ch,c,len,m,n,T = 0,real,k;
    while(1){
        real = 1;
        k = 0;
        memset(str,'\0',sizeof(str));
        memset(puz,' ',sizeof(puz));
        for(int i = 0;i < 5;i++){
            gets(puz[i]);
            if(puz[0][0] == 'Z')
                return 0;
                //1.break;
                //2.exit(0);
            if(puz[i][4] == '\0')
                puz[i][4] = ' ';
        }
        /*1.if(puz[0][0] == 'Z')
            break;*/
        for(int i = 0;i < 5;i++){
            for(int j = 0;j < 5;j++){
                if(puz[i][j] == ' '){
                    m = i;
                    n = j;
                }
            }
        }

        while((c = getchar())!='0'){
            if(!isspace(c))
                str[k++] = c;
        }
        while(1){
            c = getchar();
            if(isspace(c))
                break;
        }
        //以下注释部分为测试代码
//        puts(puz[0]);
//        puts(str);
//        printf("m=%d,n=%d\n",m,n);
        len = strlen(str);
        int x = m, y = n;
        for(int i = 0; i < len;i++){
            switch(str[i])
            {
                case 'A':
                        x--;
                    break;
                case 'B':
                        x++;
                    break;
                case 'L':
                        y--;
                    break;
                case 'R':
                        y++;
                    break;
                default:
                    real = 0;
                    break;
            }
            if(x < 0||x >4||y < 0||y > 4){
                real = 0;
                break;
            }
            else{
                puz[m][n] = puz[x][y];
                puz[x][y] = ' ';
                m = x;
                n = y;
            }
        }
        if(T++)
            printf("\n");
        printf("Puzzle #%d:\n",T);

        if(real){
            for(int i = 0;i < 5;i++){
                printf("%c",puz[i][0]);
                for(int j = 1;j < 5;j++)
                    printf(" %c",puz[i][j]);
                printf("\n");
            }
        }
        else
            printf("This puzzle has no final configuration.\n");
    }
    return 0;
}


下图是enter之前
图片说明

下图是enter之后
图片说明

Csdn user default icon
上传中...
上传图片
插入图片
准确详细的回答,更有利于被提问者采纳,从而获得C币。复制、灌水、广告等回答会被删除,是时候展现真正的技术了!
其他相关推荐
【ACM】Solution of UVA 227-Puzzle
AC代码 写得很难看 以后有空再重写吧 W了一次Presentation Error了一次 W是因为拼错单词了 PE是行末最后不要再空一格 注意:scanf的返回值不是读入的内容,而是正确读入的数量 还有要注意处理回车 #include #include #define N 5 int main() {     char puzzle[N][N];
关于图像检索方面的一些怪想法
目前图像检索的局限性
象棋 (Xiangqi, ACM/ICPC Fuzhou 2011, UVa1589)
DescriptionXiangqi is one of the most popular two-player board games in China. The game represents a battle between two armies with the goal of capturing the enemy’s “general” piece. In this problem, y
UVA 10600 - ACM Contest and Blackout(最小生成树&次小生成树)
题目链接:点击打开链接 题意:n个点,m条边,求最小生成树的值和次小生成树的值。 思路:最小生成树就不说了, 如何求次小生成树:可以证明, 次小生成树一定是最小生成树加一条边然后减去一条边形成的。  所以只需要枚举减去最小生成树中的哪条边, 然后在此前提下再生成一遍最小生成树就行了, 复杂度O(n*m)。 还有一种更好的方法:枚举要加入哪条新边, 在最小生成树上加入一条边u-v后,图上会出现
Rails,ACM/ICPC CERC 1997,UVa514
Description There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extremely limited that time. It wa
Data Mining UVA1591原题翻译+题解
Dr. Tuple is working on the new data-mining application for Advanced Commercial Merchandise Inc. Tuple先生工作在新的数据挖掘应用对先进的商业货物。(明显句子不通。。。) One of the subroutines for this application works with two arra
关于一些初级ACM竞赛题目的分析和题解(五)。
关于一些初级ACM竞赛题目的分析和题解(五)。 拓展了一些字母变换的题目,看题:   131A. cAPS lOCK time limit per test 0.5 second memory limit per test 256 megabytes input standard input output standa
UVA - 1619 Feel Good(高效算法:滑动窗口)
题意大致是从一个数列里找一个最短的子序列,使得这个子序列的最小值乘这个子序列的和最大。 这道题最关键的地方是找到数列中的某个数在哪个连续序列里是最小的,即这个数的统治区域,一开始我想到的就是输入完之后重新遍历数列,向前向后遍历找第一个比它大的,但是总是感觉会超时,于是我想到了另一种方法,滑动窗口,就可以在输入数据的时候同时找到这个数的的统治区域,分析如下: 滑动窗口的精髓是在一个数列里保存着一
ACM超级经典算法大集合
ACM超级经典算法大集合。大家都知道acm大赛对计算机专业的大学生说是很有用的
UVA 817 - According to Bartjens(暴力搜索)
According to Bartjens  The wide dissemination of calculators and computers has its disadvantages. Even students in technical disciplines tend to exhibit a surprising lack of calculating a