HDU 1033 Edge

Edge

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

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

VAVV

 

Sample Output

300 420 moveto310 420 lineto310 430 linetostrokeshowpage300 420 moveto310 420 lineto310 410 lineto320 410 lineto320 420 linetostrokeshowpage

 

Source

University of Ulm Local Contest 2003

 

Recommend

We have carefully selected several similar problems for you:  1031 1035 1036 1039 1032 

 

Statistic | Submit | Discuss | Note

。。。

长的像难题的水题，不知道该说什么

V是向左，A是向右，求每个节点的坐标。输出里的英文没什么规律，直接输出就行。

我这里用flag代表方向，0向右 1向上 2向左 3向下

#include<stdio.h>#include<string.h>#include<stdlib.h>#include<algorithm>using namespace std;char a[1000];int main(){int x,y,i,len,flag;while(~scanf("%s",a)){printf("300 420 moveto\n310 420 lineto\n");x=310; y=420; flag=0;len=strlen(a);for(i=0;i<len;i++){if(a[i]=='V'){switch(flag){case 0:flag=1; y+=10;break;case 1:flag=2; x-=10;break;case 2:flag=3; y-=10;break;case 3:flag=0; x+=10;break;}}else {switch(flag){case 0:flag=3; y-=10;break;case 1:flag=0; x+=10;break;case 2:flag=1; y+=10;break;case 3:flag=2; x-=10;break;}}printf("%d %d lineto\n",x,y);}printf("stroke\nshowpage\n");}return 0;}