https://vjudge.net/problem/UVA-227
这个题搞人心态,各种输入输出空格空行。。
int main()
{
char a[5][5];
int m,n;
int countt=0;
string str;
while(gets(a[0])){//当有新的第一行输入时
if(a[0][0]=='Z') break;
for(int i=1;i<5;i++)
gets(a[i]);//这儿之前是用scanf读入,一直WA
for(int i=0;i<5;i++)
for(int j=0;j<5;j++)
{
if(a[i][j]==' ')
{
m=i;
n=j;
}
}
string order="",s;
int wrong=0;
while(cin>>s){
order+=s;
if(s[s.length()-1]=='0') break;
}
getchar();//读入上次按回车出结果时的空格,否则下次的gets就读入了
for(int k=0;k<order.length()-1;k++)
{
if(order[k]=='A') {
if(m-1<0) {wrong=1;break;}
else {a[m][n]=a[m-1][n];a[m-1][n]=' ';m-=1;}}
if(order[k]=='B') {
if(m+1>4) {wrong=1;break;}
else {a[m][n]=a[m+1][n];a[m+1][n]=' ';m+=1;}}
if(order[k]=='L') {
if(n-1<0) {wrong=1;break;}
else {a[m][n]=a[m][n-1];a[m][n-1]=' ';n-=1;}}
if(order[k]=='R') {
if(n+1>4) {wrong=1;break;}
else {a[m][n]=a[m][n+1];a[m][n+1]=' ';n+=1;}}
}
if(countt) printf("\n");
printf("Puzzle #%d:\n",++countt);
if(wrong) printf("This puzzle has no final configuration.\n");
else
for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
{printf("%c",a[i][j]);
if(j<4) printf(" ");}
printf("\n");
}
}
}