算典03_习题_05_Uva-227

Puzzle

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

char maps[10][10];
int sx, sy, mx, my;

bool moves(char c){
switch(c){
case 'A': mx = sx - 1; my = sy; break;
case 'B': mx = sx + 1; my = sy; break;
case 'L': mx = sx; my = sy - 1; break;
case 'R': mx = sx; my = sy + 1; break;
}
if(mx < 0 || mx >4 || my < 0 || my > 4)return false;
maps[sx][sy] = maps[mx][my];
maps[sx=mx][sy=my] = ' ';
return true;
}

bool read(){
for(int i = 0; i < 5; ++i){
gets(maps[i]);
if(i == 0 && maps[0][0] == 'Z')return false;
}

for(int i = 0; i < 5; ++i){
for(int j = 0; j < 5; ++j){
if(maps[i][j] == ' '){
sx = i; sy = j;
i = j = 5;
}
}
}

return true;
}

int main(){
#ifdef _LOCAL
freopen("in.txt","r", stdin);
#endif // _LOCAL

bool line = 0; int kase = 0;
while(read()){
if(line)printf("\n");
if(!line)line = 1;
printf("Puzzle #%d:\n", ++kase);

char ch;
bool flag = 0;
while(ch = getchar()){
if(ch == '0') break;
if(ch != 'A' && ch != 'B' && ch != 'L' && ch != 'R') continue;
if(!moves(ch)){
flag = 1;
}
}
if(flag){
printf("This puzzle has no final configuration.\n");
gets(maps[0]); continue;
}

for(int i = 0; i < 5; ++i){
for(int j = 0; j < 5; ++j){
printf("%c", maps[i][j]);
if(j != 4) printf(" ");
}
printf("\n");
}
gets(maps[0]);
}
return 0;
}