hdu_1033(我怎么找到的这么水的题，只为保存代码。。。)

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int Max = 250;
int ansx[Max],ansy[Max];
//0,1,2,3表示方向，顺时针标注
void ans(int tx,int ty, int dir,int id)
{
    if(dir == 0){
        ansx[id+1] = tx+10;
        ansy[id+1] = ty;
    }
    else if(dir == 1){
        ansx[id+1] = tx;
        ansy[id+1] = ty+10;
    }
    else if(dir == 2){
        ansx[id+1] = tx-10;
        ansy[id+1] = ty;
    }
    else if(dir == 3){
        ansx[id+1] = tx;
        ansy[id+1] = ty-10;
    }
}
int main()
{
    int dir = 0;
    char query[Max];
    while(~scanf("%s",query))
    {
        dir = 0;
        ansx[0] = 310,ansy[0] = 420;
        int len = strlen(query);
        for(int i = 0; i < len; i++)
        {
            if(query[i]=='V') {
                dir = (dir+5)%4;
                ans(ansx[i],ansy[i],dir,i);
            }
            else if(query[i]=='A'){
                dir = (dir+3)%4;
                ans(ansx[i],ansy[i],dir,i);
            }
        }
        printf("300 420 moveto\n");
        for(int i = 0; i <= len; i++){
            printf("%d %d lineto\n",ansx[i],ansy[i]);
        }
        printf("stroke\nshowpage\n");
    }
    return 0;
}