UVa 10452 - Marcus

#include <iostream>
#define EOF (-1)

using namespace std;

char Path[12][100];
int Step[7]={0};//记录走过的足迹
char example[8] = {'@','I','E','H','O','V','A','#'};

void Dfs(int n,int m,int ex);
int main(){
int line,m,n;
string Commands[3]={"forth","left","right"};
//freopen("D:\\t.txt","r",stdin);
while((cin>>line)&&(line!=EOF)){
for(int i = 0;i < line;i++){
cin>>n>>m;//输入鹅卵石路的宽m，长n
for(int j=0;j<n;j++){
for(int k=0;k<m;k++){
cin>>Path[j][k];
}
}

for(int q = 0;q < m;q++){
if(example[0] == Path[n-1][q]){
Dfs(n-1,q,0);
break;
}
}
for(int t = 0;t < 7;t++){
cout<<Commands[Step[t]];
if(t<6)cout <<" ";
}
cout<<endl;
}
}
return 0;
}

void Dfs(int n,int m,int ex)
{
if( (Path[n-1][m] == example[ex+1]) && (ex<7)) {
Step[ex] = 0;
Dfs(n-1,m,ex+1);
}
if( (Path
[m-1] == example[ex+1]) && (ex<7)){
Step[ex] = 1;
Dfs(n,m-1,ex+1);
}
if( (Path
[m+1] == example[ex+1]) && (ex<7)){
Step[ex] = 2;
Dfs(n,m+1,ex+1);
}
}