hdu 1033 Edge

题目地址：http://acm.hdu.edu.cn/showproblem.php?pid=1033

 

题目描述：

Edge

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1150    Accepted Submission(s): 760

Problem Description

For products that are wrapped in small packings it is necessary that the sheet of paper containing the directions for use is folded until its size becomes small enough. We assume that a sheet of paper is rectangular and only folded along lines parallel to its initially shorter edge. The act of folding along such a line, however, can be performed in two directions: either the surface on the top of the sheet is brought together, or the surface on its bottom. In both cases the two parts of the rectangle that are separated by the folding line are laid together neatly and we ignore any differences in thickness of the resulting folded sheet.
After several such folding steps have been performed we may unfold the sheet again and take a look at its longer edge holding the sheet so that it appears as a one-dimensional curve, actually a concatenation of line segments. If we move along this curve in a fixed direction we can classify every place where the sheet was folded as either type A meaning a clockwise turn or type V meaning a counter-clockwise turn. Given such a sequence of classifications, produce a drawing of the longer edge of the sheet assuming 90 degree turns at equidistant places.

 

 

Input

The input contains several test cases, each on a separate line. Each line contains a nonempty string of characters A and V describing the longer edge of the sheet. You may assume that the length of the string is less than 200. The input file terminates immediately after the last test case.

 

 

Output

For each test case generate a PostScript drawing of the edge with commands placed on separate lines. Start every drawing at the coordinates (300, 420) with the command "300 420 moveto". The first turn occurs at (310, 420) using the command "310 420 lineto". Continue with clockwise or counter-clockwise turns according to the input string, using a sequence of "x y lineto" commands with the appropriate coordinates. The turning points are separated at a distance of 10 units. Do not forget the end point of the edge and finish each test case by the commands stroke and showpage.

You may display such drawings with the gv PostScript interpreter, optionally after a conversion using the ps2ps utility.

 

 

Sample Input

V AVV

 

 

Sample Output

300 420 moveto 310 420 lineto 310 430 lineto stroke showpage 300 420 moveto 310 420 lineto 310 410 lineto 320 410 lineto 320 420 lineto stroke showpage

 

题意： 起点都是在(300,420)  都会首先向东走 到 （310，420），然后V 是逆时针转弯  A是顺时针转弯 每个走10的长度。

 

题解：直接模拟。

 

代码：

/*
hdu:Edge

direction array:int dir[4][2]={10,0,0,10,-10,0,0,-10};it's a good strategy or method

*/
#include
#include
#include

char GStr[200+5]={'\0'};
int X=0,Y=0;
int dire=0;//0->north,1->east,2->south,3->west  + -> clockwise , - ->counter clockwise

/*go forward according to the dire(direction)*/
int GoForward(int &X,int &Y,int dire)
{
    switch(dire)
    {
        case 0:
        Y+=10;
        break;
        case 1:
        X+=10;
        break;
        case 2:
        Y-=10;
        break;
        case 3:
        X-=10;
        break;
        default:
        break;
    }
    return(0);
}

/*for test*/
int test()
{
    return(0);
}

/*main process*/
int MainProc()
{
    while(gets(GStr)!=NULL)
    {
        int Len=strlen(GStr);
        int i=0;
        printf("300 420 moveto\n310 420 lineto\n");
        X=310;
        Y=420;
        dire=1;
        for(i=0;i<=Len-1;i++)
        {
            if(GStr[i]=='A')
            {
               dire=(dire+1)%4;//means loop add
            }
            else
            {
               dire=(dire+3)%4;//means loop sub
            }
            GoForward(X,Y,dire);
            printf("%d %d lineto\n",X,Y);
        }
        printf("stroke\nshowpage\n");
    }
    return(0);
}

int main()
{
    MainProc();
    return(0);
}