蓝桥杯2014年第五届真题-兰顿蚂蚁-题解（C++代码）

解题思路:
根据题意 硬撸就行 无算法 无技巧
注意事项:

参考代码:

#include<stdio.h>

int main()

{

     int m,n,a[105][105],x,y,k;

     char s;

     scanf("%d %d",&m,&n);

     for(int i=0;i<m;i++){

         for(int j=0;j<n;j++){

              scanf("%d",&a[i][j]);

         }

     } 

     scanf("%d %d %c %d",&x,&y,&s,&k);

     int x1=x;

     int y1=y;

     char s1=s;

     for(int i=1;i<=k;i++){

         if(a[x1][y1]==0){

              a[x1][y1]=1;

             if(s1=='L'){

                 s1='D';

                 x1++;

             }else if(s1=='R'){

                 s1='U';

                 x1--;

             }else if(s1=='U'){

                 s1='L';

                 y1--;

             }else if(s1=='D'){

                 s1='R';

                 y1++;

             }

         }else if(a[x1][y1]==1){

             a[x1][y1]=0;

             if(s1=='L'){

                 s1='U';

                 x1--;

             }else if(s1=='R'){

                 s1='D';

                 x1++;

             }else if(s1=='U'){

                 s1='R';

                 y1++;

             }else if(s1=='D'){

                 s1='L';

                 y1--;

             }

         }

     } 

     printf("%d %d",x1,y1);

     return 0;

 }