poj 1573 模拟

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;

int n,m;

bool out(int x,int y){if((x>=0 && x<n)&&(y>=0 && y<m))return 0;return 1;}

int main()
{
int start;
bool visit[12][12];
char c[12][12];
int num[12][12],x,y,i,j;
int cnt,flag,ans1,ans2;
// freopen("in.txt","r",stdin);
while(scanf("%d%d%d",&n,&m,&start)!=EOF)
{
if(n==0 && m==0 && start==0) break;
flag=0;
for(i=0;i<n;i++)
scanf("%s",&c[i]);
memset(visit,0,sizeof(visit));
memset(num,0,sizeof(num));
x=0;
y=start-1;
cnt=0;
while(!out(x,y))
{
if(visit[x][y]){flag=1;ans1=cnt;ans2=num[x][y];break;}
num[x][y]=++cnt;
visit[x][y]=1;
switch(c[x][y])
{
case 'E':y+=1;break;
case 'W':y-=1;break;
case 'S':x+=1;break;
default:x-=1;
}

}
if(flag==1) printf("%d step(s) before a loop of %d step(s)\n",ans2-1,ans1-ans2+1);
else printf("%d step(s) to exit\n",cnt);
}
return 0;
}