hdu 1035(簡潔版)

來源:互聯網
上載者:User
/* * 1035_3.cpp * *  Created on: 2013年8月17日 *      Author: Administrator */#include <iostream>using namespace std;char map[11][11];int num[11][11];int n,m,k,t,loop;bool overmap(int x , int y){if( x < 1 || x > n || y < 1 || y > m){return true;}return false;}void dfs(int x , int y){if(overmap(x,y) || loop > 0){if(loop > 0){printf("%d step(s) before a loop of %d step(s)\n",t - loop , loop);}else{printf("%d step(s) to exit\n",t);}return ;}if(num[x][y] == 0){num[x][y] = ++t;}else{loop = t - num[x][y] + 1;}switch(map[x][y]){case 'N':--x;dfs(x,y);++x;break;case 'S':++x;dfs(x,y);--x;break;case 'W':--y;dfs(x,y);++x;break;case 'E':++y;dfs(x,y);--y;break;}}int main(){while(scanf("%d %d %d",&n,&m,&k)!=EOF,n||m){getchar();int i,j;t = 0;loop = 0;memset(num,0,sizeof(num));memset(map,0,sizeof(map));for(i = 1; i <= n ; ++i){for( j = 1 ; j <= m ;++j){scanf("%c",&map[i][j]);}getchar();}dfs(1,k);}}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.