hdoj 1035 Robot Motion

题目链接：～(￣▽￣～)(～￣▽￣)～

code：

#include <stdio.h>
int count1 = 0, count2 = 0, m = 0, n = 0;
typedef struct
{
	char ch;
	int used, count;
}node;
node map[12][12];
void mo(int x, int y)
{
	if(x<1 ||x>m || y<1 || y>n)//找到出口；
	{
		printf("%d step(s) to exit\n",count1);
	}
	else  if(map[x][y].used)//找到循环；
	{
		printf("%d step(s) before a loop of %d step(s)\n", map[x][y].count,count1-map[x][y].count);
	}
	else  if(map[x][y].ch == 'N' && !map[x][y].used)
	{
		map[x][y].count = count1++;
		map[x][y].used = 1;
			mo(x-1, y);
	}
	else  if(map[x][y].ch == 'W' && !map[x][y].used)
	{
		map[x][y].count = count1++;
		map[x][y].used = 1;
		mo(x, y-1);
	}
	else if(map[x][y].ch == 'S' && !map[x][y].used)
	{
		map[x][y].count = count1++;
		map[x][y].used = 1;
		mo(x+1, y);
	}
	else if(map[x][y].ch == 'E' && !map[x][y].used)
	{
		map[x][y].count = count1++;
		map[x][y].used = 1;
		mo(x, y+1);
	}
}
int main()
{
	int i = 0, j = 0, start = 0;
	while(scanf("%d %d",&m,&n) != EOF, m != 0 && n != 0)
	{
		scanf("%d",&start);
		getchar();
		for(i = 1; i<=m; i++)
		{
			for(j = 1; j<=n; j++)
			{
				scanf("%c",&map[i][j].ch);
				map[i][j].used = 0;
			}
			getchar();
		}
		count1 = 0;
		mo(1, start);
	}
	return 0;
}