# Edge

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

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

Source

University of Ulm Local Contest 2003

``` 1 #include<stdio.h>
2 #include<string.h>
3 #include<stdlib.h>
4 #define maxn 205
5 char str[maxn];
6 int main()
7 {
8     int len,i,x,y;
9     char dir;   //记录 up,down,left,right
10  while(scanf("%s",str)!=EOF)
11  {
12     len=strlen(str);
13   if(len==0)
14       return 0;
15   printf("300 420 moveto\n310 420 lineto\n");
16     x=310,y=420;
17     dir='r';     //初始化为向右
18   for(i=0;i<len;i++)
19   {
20
21       if(str[i]=='A')
22       {
23           /*顺时针方向进行*/
24           switch(dir)
25           {
26             case 'u': x+=10,dir='r'; break;
27             case 'd': x-=10,dir='l'; break;
28             case 'r': y-=10,dir='d'; break;
29             case 'l': y+=10,dir='u'; break;
30           }
31       }
32       else if(str[i]=='V')
33       {
34           /*逆时针方向*/
35           switch(dir)
36           {
37           case 'u': x-=10,dir='l';break;
38           case 'd': x+=10,dir='r';break;
39           case 'r': y+=10,dir='u';break;
40           case 'l': y-=10,dir='d';break;
41           }
42       }
43       printf("%d %d lineto\n",x,y);
44   }
45   printf("stroke\nshowpage\n");
46  }
47  return 0;
48 }```

657 篇文章64 人订阅

0 条评论

## 相关文章

17200

### HDUOJ-------2844Coins

Coins Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Jav...

30780

### HDUOJ----Super Jumping! Jumping! Jumping!

Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other)   Memory ...

28660

### HDUOJ -----1686

Oulipo Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Ja...

32870

### hdu---(3555)Bomb(数位dp（入门）)

Bomb Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Jav...

36680

### hdu----(4686)Arc of Dream(矩阵快速幂)

Arc of Dream Time Limit: 2000/2000 MS (Java/Others)    Memory Limit: 65535/65535...

36090

### Intro to Python Image Processing in Computational Photography

Computational photography is about enhancing the photographic process with compu...

16910

### hduoj----1142A Walk Through the Forest(记忆化搜索+最短路)

A Walk Through the Forest Time Limit: 2000/1000 MS (Java/Others)    Memory Limit...

34260

### 任何人都能看懂的反向传播算法解释，展示每一步计算，A Step by Step Backpropagation Example

Backpropagation is a common method for training a neural network. There is no sh...

21320

### hdu 3038 How Many Answers Are Wrong ( 带 权 并 查 集 )

How Many Answers Are Wrong Time Limit: 2000/1000 MS (Java/Others)    Memory Limi...

36870