这个题目算是 很简单的搜索了;
按着步骤一步一步向前走。。。
#include <iostream>
using namespace std;
int main()
{
char gird[11][11];
int g_num[11][11];
int m,n,s;
while(scanf("%d%d",&m,&n))
{
if(m==0 && n==0)
break;
scanf("%d",&s);
cin.get();
for(int i = 1; i <= m; i ++)
{
for(int j = 1; j <= n; j++)
{
scanf("%c",&gird[i][j]);
g_num[i][j] = 0;
}
cin.get();
}
int now_i = 1, now_j = s,step = 0,p=0;
while(g_num[now_i][now_j] == 0)
{
g_num[now_i][now_j] = step++;
switch(gird[now_i][now_j])
{
case 'N': now_i--;break;
case 'S': now_i++;break;
case 'W': now_j--;break;
case 'E': now_j++;break;
default : break;
}
if((now_j==s)&&(now_i==1))
break;
if(now_i>m || now_i<1 || now_j>n || now_j<1)
{
p = 1;
break;
}
}
if(p)
{
printf("%d step(s) to exit\n",step);
}
else
{
printf("%d step(s) before a loop of %d step(s)\n",g_num[now_i][now_j],step-g_num[now_i][now_j]);
}
}
}