Puzzle,ACM/ICPC World Finals 1993,UVa227

#include<iostream>
#include<string>
using namespace std;

char word[5][6];

int A(int &x,int& y){
	if(y==0){cout<<"This puzzle has no final configuration"<<endl;return 2;}
	else {swap(word[x][y],word[x][--y]);return 0;}
}

int B(int &x,int &y){
	if(y==4){cout<<"This puzzle has no final configuration"<<endl;return 2;}
	else {swap(word[x][y],word[x][++y]);return 0;}
}

int L(int &x,int &y){
	if(x==0){cout<<"This puzzle has no final configuration"<<endl;return 2;}
	else {swap(word[x][y],word[--x][y]);return 0;}
}

int R(int &x,int &y){
	if(x==4){cout<<"This puzzle has no final configuration"<<endl;return 2;}
	else {swap(word[x][y],word[++x][y]);return 0;}
}

int main(){
	for(;;){
		int count=1;
		int x,y;
		gets(word[0]);
		if(word[0][0]=='Z')break;
		for(int i=1;i<5;i++)gets(word[i]);
		for(int i=0;i<5;i++){
			for(int j=0;j<5;j++){
				if(word[i][j]==' '){x=i;y=j;}
			}
		}
		string str;
		cin>>str;
		int leng=str.length();
		int real=0;
		for(int i=0;i<leng;i++){
			switch(str[i]){
			case 'A':real=A(x,y);
				break;
			case 'B':real=B(x,y);
				break;
			case 'L':real=L(x,y);
				break;
			case 'R':real=R(x,y);
				break;
			default :real=1;
			}
			if(real)break;
		}
		if(!(real-1)){
			cout<<"Puzzle #"<<count<<":"<<endl;
			for(int i=0;i<5;i++){
				for(int j=0;j<4;j++)cout<<word[j][i]<<" ";
				cout<<word[5][i];
				cout<<endl;
			}
			count++;
			cout<<endl;
		}
	}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值