pku1573.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <stdlib.h>

char Map[11][11];
int nx, ny;
int way[11][11];

int Out(int x, int y)
{
	if (x < 0 || y < 0 || x >= nx || y >= ny)
	{
		return 1;
	}
	return 0;
}

int main()
{
	int i, start, x, y;
	while (scanf("%d%d%d", &nx, &ny, &start) != -1)
	{
		if (nx == 0 && ny == 0 && start == 0)
		{
			break;
		}
		start--;
		for (i = 0; i < nx; i++)
		{
			scanf("%s", Map[i]);
		}
		x = 0;
		y = start;
		memset(way, -1, sizeof(way));
		way[x][y] = 0;
		for (i = 0; ;)
		{
			switch (Map[x][y])
			{
			case 'W':
				{
					y--;
					break;
				}
			case 'E':
				{
					y++;
					break;
				}
			case 'N':
				{
					x--;
					break;
				}
			case 'S':
				{
					x++;
					break;
				}
			}
			i++;
			if (Out(x, y))
			{
				printf("%d step(s) to exit\n", i);
				break;
			}
			if (way[x][y] != -1)
			{
				printf("%d step(s) before a loop of %d step(s)\n", way[x][y], i - way[x][y]);
				break;
			}
			way[x][y] = i;
		}
	}
	return 0;
}