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

问题描述

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

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,'',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] == '')
                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=%dn",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之后

时间: 2024-12-09 10:56:48

uva-关于ACM中遇到的一些怪问题求解 Uva 227-Puzzle的相关文章

c++ acm 括号配对-c++编写的ACM中的括号配对问题

问题描述 c++编写的ACM中的括号配对问题 最近在做ACM上的题目,在vs上写了一个括号配对的程序能运行出来,但是放到ACM上就是各种错误,最多的是runtimeerror,下面附上程序,希望高手能指点一下.. #include #include #include #include using namespace std; int main() { int N; //测试数据组 cin>>N; if(N100) { cout<<"please input number

应用-广义表和链表在acm中的重要性

问题描述 广义表和链表在acm中的重要性 数据结构课中学习了广义表,好奇其在实际应用编程中的应用 特别是在acm 解决方案 广义表侧重于阐述一种递归的数据结构的概念,这种概念对于诸如分治法.分区.矩阵运算等等都很有用,而链表则是构造各种更复杂数据结构,比如队列.堆栈.向量.树.图.环等等的基础.

c++-大一刚转专业的,请问下,代码在acm中时间超限为什么

问题描述 大一刚转专业的,请问下,代码在acm中时间超限为什么 #include using namespace std; int main() { int n, a[50], i,j,num,max,count; while (cin >> n) { if (n == 0) break; max = 0; num = 1; for (i = 0; i < n; i++) { cin >> a[i]; if (a[i] == 0) break; if (a[i]>max

asp.net 在DNN模块开发中遇到的resx怪问题_实用技巧

在DNN模块开发中遇到的resx怪问题 最近在修改以前的一个CrossArticle模块,其中有一个Test.ascx文件中的resourkey始终只能显示直接给出的text值,而不能显示resx文件中的值. 而其他ascx文件皆能使用自己resx中的文本. 反复检查了N次,快疯了.用vs2008的 tools菜单下的生成resx也不能解决问题. 请朋友们能个提示,谢谢. 相关代码片断: <?xml:namespace prefix = asp />" resourcekey=&qu

ACM中Java的应用

先说一下Java对于ACM的一些优点吧: (1) 对于熟悉C/C++的程序员来说Java 并不难学,两周时间基本可以搞定一般的编程,再用些时间了解一下Java库就行了.Java的语法和C++非常类似,可以说是C++的升级版,只是更加强调面向对象思想而已.(个人见解...) (2) 在一般比赛中,Java程序会有额外的时间和空间,但真正进行大规模运算时Java并不比C/C++慢,输入输出效率比较低而已 (3) Java 代码简单且功能强大,有些像高精度之类的算法用Java实现起来更为简洁方便(AC

计算机专业教学中的若干问题的思考——“计算机问题求解课”总结

参加"CCF计算机课程改革导教班"的学习期间,由于在时间.地点.课程选择上的精心安排,度过了一段很安静,很专心的学习时间.资深教授利用有跨度的课程做出具体.深入引导,多次畅所欲言的自由研讨,以及课后无时不在的个别深度交流,对于一名热爱专业教学的教师而言,这是一段很享受的时光.我时时能想起牛津大学学院制的生活是否是这样,而这显然就是"过一种完整幸福的教育生活[ "新教育实验"的口号.新教育实验,是一个民间教育改革行动.一个以教师发展为起点,以帮助新教育共同体

嵌套在frame 中的系统的怪问题

问题描述 我有一个系统,登录后的页面用frame分成左右两个ASPX页面,现在我把该系统放在另一个页面的frame中,但是问题出现了,系统登录后frame中的两个页面无法显示(两个页面没有跳转到相应的页面).我想问题应该是frame中套frame导致的问题,请问如何解决? 解决方案 解决方案二:应该是路径错误,你可以在空白页面右击看路径是否和现实的肯定不对应解决方案三:不是什么怪问题,嵌套在iframe中路径发生了变化,调试!解决方案四:应该是路径的问题,贴代码看看解决方案五:路径问题!

Linux中文件执行中的锁定的怪现象

  本来今天不准备开电脑了,太困了,想睡觉,然而一哥们儿短信都发过来了,要问个问题,于是还是打开了电脑,没想到是一个很有代表性的问题,顺便也牵扯了前些天我的工作中的一个bug,值得记录下来.问题如下: linux下,一个可执行文件exe1正在执行中,rm –f可以将其删除,mv可以将其移除,mv $other exe1也可以将其替换,但是cp $other exe1则显示文件忙,求解. 这实际上并不是一个真正的问题,因为只要你的基础知识扎实,这个问题显然很简单,原因只有一个,那就是linux文件

WPS中轻松输入生僻怪字

  ①启动WPS文字2013,单击插入--符号--其他符号. ②选择简体中文GB2312(十六进制),然后找到王,选中. ③切换为Unicode(十六进制),这时以"王"为偏旁部首的汉字就会全部出现. ④拉动滚动条,就能找到我们需要的璩字了.单击插入按钮即可将文字插入到WPS页面中.