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

解题思路:

照着题目写就行

参考代码:

#include <iostream>
#include<cstdio>
#include<vector>
#include<cctype>
using namespace std;
int main()
{
    int m,n,bx,by,k,col,row;
    char dir;
    while(scanf("%d %d",&m,&n)!=EOF)
    {
        vector<vector<int> >num(m,vector<int>(n));
        for(int i=0;i<m;++i)
            for(int j=0;j<n;++j)
            scanf("%d ",&num[i][j]);
        scanf("%d %d %c %d",&bx,&by,&dir,&k);
        while(k)
        {
            --k;
            switch(toupper(dir))
            {
               case 'U':
                   {
                    if(num[bx][by]) {dir='R';num[bx][by]=0;++by;}
                    else {dir='L';num[bx][by]=1;--by;}
                    col=bx;row=by;
                    break;
                   }
               case 'D':
                   {
                    if(num[bx][by]) {dir='L';num[bx][by]=0;--by;}
                    else {dir='R';num[bx][by]=1;++by;}
                    col=bx;row=by;
                    break;
                   }
               case 'L':
                   {
                    if(num[bx][by]) {dir='U';num[bx][by]=0;--bx;}
                    else {dir='D';num[bx][by]=1;++bx;}
                    col=bx;row=by;
                    break;
                   }
               case 'R':
                   {
                    if(num[bx][by]) {dir='D';num[bx][by]=0;++bx;}
                    else {dir='U';num[bx][by]=1;--bx;}
                    col=bx;row=by;
                    break;
                   }
            }
        }
        cout<<col<<" "<<row<<endl;
    }
    return 0;
}