hdu 1033 Edge

Edge

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


[align=left]Problem Description[/align]
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.

[align=left]Input[/align]
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.

[align=left]Output[/align]
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.



[align=left]Sample Input[/align]

V
AVV

[align=left]Sample Output[/align]

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

[align=left]Source[/align]
University
of Ulm Local Contest 2003

[align=left]Recommend[/align]
We have carefully selected several similar problems for
you: 1031 1035 1036 1039 1032

一道模拟题，就是题目太长，看题意有点烦，不过看懂后很好做，分开讨论就好。

题意：前两行和最后两行固定输出，固定的两个点第二点为轴旋转，V顺时针，A逆时针，每次都以旋转后的点为轴旋转。

附上代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char ch[205];
int i,j,a,b;
while(~scanf("%s",ch))
{
int len=strlen(ch),p=1;
a=310,b=420;
printf("300 420 moveto\n");
printf("310 420 lineto\n");
for(i=0; i<len; i++)
{
if(p==1)  //x轴正方向
{
if(ch[i]=='V') p=2,b+=10;
else p=-2,b-=10;
}
else if(p==2)  //y轴正方向
{
if(ch[i]=='V') p=-1,a-=10;
else p=1,a+=10;
}
else if(p==-1)
{
if(ch[i]=='V') p=-2,b-=10;
else p=2,b+=10;
}
else
{
if(ch[i]=='V') p=1,a+=10;
else p=-1,a-=10;
}
printf("%d %d lineto\n",a,b);
}
printf("stroke\nshowpage\n");
}
return 0;
}