学步园

#include<iostream><br /> using namespace std;</p> <p>#define MAXSIDE 10<br /> #define bool int</p> <p>int row,col,start;<br /> char grid[MAXSIDE+2][MAXSIDE+2];<br /> int road[MAXSIDE+2][MAXSIDE+2];</p> <p>void Go(int now_r, int now_c) {<br /> if(now_r<1 || now_c<1 || now_r>row || now_c>col) {<br /> printf("%d step(s) to exit/n", road[now_r][now_c]-1);<br /> return;<br /> }</p> <p> int next_r, next_c;<br /> switch(grid[now_r][now_c]) {<br /> case 'N':<br /> next_r = now_r - 1;<br /> next_c = now_c;<br /> break;<br /> case 'S':<br /> next_r = now_r + 1;<br /> next_c = now_c;<br /> break;<br /> case 'E':<br /> next_r = now_r;<br /> next_c = now_c + 1;<br /> break;<br /> case 'W':<br /> next_r = now_r;<br /> next_c = now_c - 1;<br /> break;<br /> default:<br /> break;<br /> }<br /> if(road[next_r][next_c]) {<br /> printf("%d step(s) before a loop of %d step(s)/n", road[next_r][next_c]-1, road[now_r][now_c]-road[next_r][next_c]+1);<br /> return;<br /> }<br /> road[next_r][next_c] = road[now_r][now_c] + 1;<br /> Go(next_r, next_c);<br /> }</p> <p>int main() {<br /> while(scanf("%d%d%d", &row, &col, &start)&&row||col||start) {<br /> int i=1;<br /> for(; i<=row; i++) {<br /> scanf("%s", &grid[i][1]);<br /> }</p> <p> memset(road, 0, sizeof(road));<br /> road[1][start] = 1;<br /> Go(1, start);<br /> }<br /> return 0;<br /> }