Edge

Edge

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

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

 

 

拿谷歌翻译、各种词典翻译了半天还是不懂他在说什么，尼馬，这是在挑战我们的智商吗？毫无疑问，在这个题上我的确是有些弱智了。

这是一个简单的模拟题，题意很简单，初始坐标是（310.420），然后 v 代表向左转，A 代表向右转。怎样？就是这么坑爹。。。！！！

下面贴代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

int main()
{
    char str[210];
    while(scanf("%s",str)!=EOF){
        int len=strlen(str);
        printf("300 420 moveto\n310 420 lineto\n");
        int turn =1;
        int x=310,y=420;
        for(int i=0;i<len;i++){
            switch(turn){
                case 1:
                    if(str[i]=='V')
                        turn =2,y+=10;
                    else
                        turn =4,y-=10;
                    break;
                case 2:{
                        if(str[i]=='V')
                            turn =3,x-=10;
                        else
                            turn =1,x+=10;
                        break;
                    }
                case 3:{
                        if(str[i]=='V')
                            turn =4,y-=10;
                        else
                            turn =2,y+=10;
                        break;
                    }
                default: {
                        if(str[i]=='V')
                            turn=1,x+=10;
                        else
                            turn=3,x-=10;
                    }
            }
            printf("%d %d lineto\n",x,y);
        }
        printf("stroke\nshowpage\n");
    }
    return 0;
}