int ans; int v[105][105],w[105][105]; int a,b,c,t; void dfs(int x,int y) { if(t==1) return ; v[x][y]=1; ans++; if(ch[x][y]=='N') x-=1; else if(ch[x][y]=='E') y+=1; else if(ch[x][y]=='S') x+=1; else if(ch[x][y]=='W') y-=1; if(x<0||y<0||x>=a||y>=b) { t=1; printf("%d step(s) to exit\n",ans); return ; } else if(v[x][y]) { t=1; printf("%d step(s) before a loop of %d step(s)\n",w[x][y],ans-w[x][y]); return ; } w[x][y]=ans; if(!v[x][y]) dfs(x,y); } int main() { while(cin>>a>>b>>c) { if(a==0||b==0||c==0) break; t=0; int i,j; for(i=0;i
|