POJ 1573

 #include<iostream>
 #include<stdio.h>
 #define MAXN 15
 using namespace std;

 char _m[MAXN][MAXN];
 bool mark[MAXN][MAXN];
 int  record[MAXN][MAXN];

 int r;
 int c;
 void dfs(int i,int j);
 int main()
 {
     //freopen("acm.acm","r",stdin);
     int i;
     int j;
     int place;
     while(cin>>r>>c>>place)
     {
         if(!r && !c && !place)
             break;
         -- place;
         memset(mark,false,sizeof(mark));
     //    memset(record,0,sizeof(record));
         for(i = ; i < r; ++ i)
         {
             for(j = ; j < c; ++ j)
             {
                 record[i][j] = ;
             }
         }
         for(i = ; i < r; ++ i)
         {
             for(j = ; j < c; ++ j)
             {
                 cin>>_m[i][j];
             }
         }
         record[][place] = ;
         mark[][place] = true;
         dfs(,place);
     //    for(i = 0; i < r; ++ i)
     //    {
     //        for(j = 0; j < c; ++ j)
     //        {
     //            cout<<record[i][j]<<" ";
     //        }
     //        cout<<endl;
     //    }
     }
 }
 void fun_1(int num);
 void fun_2(int num,int num_1);
 void dfs(int i,int j)
 {
     int tem1;
     int tem2;
     if(_m[i][j] == 'E')
     {
         if(j +  < c)
         {
             if(!mark[i][j+])
             {
                 mark[i][j+] = true;
                 record[i][j+] += record[i][j];
                 dfs(i,j+);
                 return ;
             }
             else
             {
                 fun_2(record[i][j+]-,record[i][j]-record[i][j+]+);
                 return ;
             }
         }
         else
         {
             fun_1(record[i][j]);
             return ;
         }
     }///////////////////////

     if(_m[i][j] == 'S')
     {
         if(i +  < r)
         {
             if(!mark[i+][j])
             {
                 mark[i+][j] = true;
                 record[i+][j] += record[i][j];
                 dfs(i+,j);
                 return ;
             }
             else
             {
                 fun_2(record[i+][j]-,record[i][j]-record[i+][j]+);
                 return ;
             }
         }
         else
         {
             fun_1(record[i][j]);
             return ;
         }
     }//////////////////////////////

     if(_m[i][j] == 'W')
     {
         if(j -  >= )
         {
             if(!mark[i][j-])
             {
                 mark[i][j-] = true;
                 record[i][j-] += record[i][j];
                 dfs(i,j-);
                 return ;
             }
             else
             {
                 fun_2(record[i][j-]-,record[i][j]-record[i][j-]+);
                 return ;
             }
         }
         else
         {
             fun_1(record[i][j]);
             return ;
         }
     }///////////////////////////////////////////

     if(_m[i][j] == 'N')
     {
         if(i -  >= )
         {
             if(!mark[i-][j])
             {
                 mark[i-][j] = true;
                 record[i-][j] += record[i][j];
                 dfs(i-,j);
                 return;
             }
             else
             {
                 fun_2(record[i-][j]-,record[i][j]-record[i-][j]+);
                 return ;
             }
         }
         else
         {
             fun_1(record[i][j]);
             return ;
         }
     }
 }

 void fun_1(int num)
 {
     cout<<num;
 //    if(num != 1)
         cout<<" step(s) to exit"<<endl;
 //    else
 //        cout<<" step to exit"<<endl;
 }

 void fun_2(int num,int num_1)
 {
     cout<<num;
 //    if(num != 1)
         cout<<" step(s) before a loop of ";
 //    else
 //        cout<<" step before a loop of ";
     cout<<num_1;
 //    if(num_1 != 1)
         cout<<" step(s)"<<endl;
 //    else
 //        cout<<" step"<<endl;
 }

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。

技术网站地址： vmfor.com