UVA-227

Solution:

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
typedef struct
{
    int x,y;
} point;
int main()
{
    int count = 0;
    while(1)
    {
        bool flag;
        int i,j;
        char pu[6][6]= {0};
//    for(i=0; i<5; i++)
//        for(j=0; j<5; j++)
//            scanf("%c",pu[5][5]);
///     %c会读取回车进入字符串中
///     A--above,B--below,L--left,R--right
//        for(i=0; i<6; i++)
//            for(j=0; j<6; j++)
//                cin>>pu[i][j];
        gets(pu[0]);if(pu[0][0]=='Z') break;
        gets(pu[1]),gets(pu[2]),gets(pu[3]),gets(pu[4]);
        count++;

///输入
        if(count>1) cout<<endl;
        cout<<"Puzzle #"<<count<<":"<<endl;
        point b;
        for(i=0; i<5; i++)
        {
            for(j=0; j<5; j++)
                if(pu[i][j]==' ')
                {
                    b.x=i,b.y=j;
                    break;
                }
        }



///判断空格位置并记录
        flag = true;
        char option;
        while(~scanf("%c",&option))
        {

            if(option=='0') break;
            else switch(option)
                {
                case 'A':
                    if(b.x==0) flag = false;
                    else
                    {
                        pu[b.x][b.y]   = pu[b.x-1][b.y];
                        pu[b.x-1][b.y] = ' ';
                        b.x = b.x-1;
                    }
//                        cout<<b.x<<"  "<<b.y<<endl;
                    break;
                case 'B':
                    if(b.x==4) flag = false;
                    else
                    {
                        pu[b.x][b.y]   = pu[b.x+1][b.y];
                        pu[b.x+1][b.y] = ' ';
                        b.x = b.x+1;
                    }
//                        cout<<b.x<<"  "<<b.y<<endl;
                    break;
                case 'L':
                    if(b.y==0) flag = false;
                    else
                    {
                        pu[b.x][b.y]   = pu[b.x][b.y-1];
                        pu[b.x][b.y-1] = ' ';
                        b.y = b.y-1;
                    }
//                        cout<<b.x<<"  "<<b.y<<endl;
                    break;
                case 'R':
                    if(b.y==4) flag = false;
                    else
                    {
                        pu[b.x][b.y]   = pu[b.x][b.y+1];
                        pu[b.x][b.y+1] = ' ';
                        b.y = b.y+1;
                    }
//                        cout<<b.x<<"  "<<b.y<<endl;
                    break;
                default :
                    continue;
                }

//            cout<<"continue"<<endl;


        }
        if(flag == false) cout<<"This puzzle has no final configuration."<<endl;
        else
        {
            for(i=0; i<5; i++)
            {
                for(j=0; j<4; j++)
                    printf("%c ",pu[i][j]);
                printf("%c\n",pu[i][j]);
            }
        }
        getchar();
    }
    return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值