HDU-1033
来源:互联网 发布:流浪儿童现状数据 编辑:程序博客网 时间:2024/05/21 06:17
Edge
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3210 Accepted Submission(s): 2030
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.
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.
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
#include<string.h>
#include<stdio.h>
int main()
{
char a[201];
int x1, y1;//(x1,y1)
int x, y;
int i, j;
while (scanf("%s",a)!=EOF )
{
x1 = 300, y1 = 420;
printf("%d %d moveto\n", x1 , y1 );
x = 310; y = 420;
printf("%d %d lineto\n", x , y );
i = 0; j = strlen(a);
while (i<j)
{
if (a[i] == 'A')
{
if (x > x1) { y1 = y; x1 = x; y -= 10; printf("%d %d lineto\n", x, y); }//竖直
else if (x < x1) { y1 = y; x1 = x; y += 10; printf("%d %d lineto\n", x, y); }
else {
if (y > y1) { x1 = x; y1 = y; x += 10; printf("%d %d lineto\n", x, y); }//水平
else { x1 = x; y1 = y; x -= 10; printf("%d %d lineto\n", x, y); }
}
}//if
else
{
if (x > x1) { y1 = y; x1 = x; y += 10; printf("%d %d lineto\n", x, y);}//竖直
else if (x < x1) { y1 = y; x1 = x; y -= 10; printf("%d %d lineto\n", x, y);}
else {
if (y > y1) { x1 = x; y1 = y; x -= 10; printf("%d %d lineto\n", x, y);}//水平
else { x1 = x; y1 = y; x += 10; printf("%d %d lineto\n", x, y);}
}
#include<stdio.h>
int main()
{
char a[201];
int x1, y1;//(x1,y1)
int x, y;
int i, j;
while (scanf("%s",a)!=EOF )
{
x1 = 300, y1 = 420;
printf("%d %d moveto\n", x1 , y1 );
x = 310; y = 420;
printf("%d %d lineto\n", x , y );
i = 0; j = strlen(a);
while (i<j)
{
if (a[i] == 'A')
{
if (x > x1) { y1 = y; x1 = x; y -= 10; printf("%d %d lineto\n", x, y); }//竖直
else if (x < x1) { y1 = y; x1 = x; y += 10; printf("%d %d lineto\n", x, y); }
else {
if (y > y1) { x1 = x; y1 = y; x += 10; printf("%d %d lineto\n", x, y); }//水平
else { x1 = x; y1 = y; x -= 10; printf("%d %d lineto\n", x, y); }
}
}//if
else
{
if (x > x1) { y1 = y; x1 = x; y += 10; printf("%d %d lineto\n", x, y);}//竖直
else if (x < x1) { y1 = y; x1 = x; y -= 10; printf("%d %d lineto\n", x, y);}
else {
if (y > y1) { x1 = x; y1 = y; x -= 10; printf("%d %d lineto\n", x, y);}//水平
else { x1 = x; y1 = y; x += 10; printf("%d %d lineto\n", x, y);}
}
}//else
i++;
}//while
printf("stroke\nshowpage\n");
}//while
return 0;
}
i++;
}//while
printf("stroke\nshowpage\n");
}//while
return 0;
}
0 0
- hdu 1033
- HDU 1033
- HDU 1033
- hdu 1033
- HDU-1033
- HDU 1033 Edge 旋转
- HDU 1033 Edge
- hdu - 1033 - Edge
- hdu 1033 Edge
- hdu 1033 Edge
- HDU 1033 Edge
- hdu 1033 (简单)
- hdu 1033 模拟
- hdu(1033)
- HDU 1033 Edge
- hdu 1033 翻译
- HDU 1033 Edge
- HDU 1033 方向模拟
- 嵌入式linux驱动开发流程总结
- 感觉马蓉好贱啊
- Java中的equals和==
- C# winform 中MessageBox用法大全(附效果图)
- Android 图片Drawable类型之Layer List
- HDU-1033
- java多线程之interrupt
- C++多线程
- VS2015使用小技巧 在同一个项目下添加多个.cs文件
- HDU 5862 Counting Intersections
- vb6.0总结
- 初见Python网络爬虫
- SpringMVC+Spring+Mybatis整合实例
- myeclipse+maven实现多模块项目struts+spring+mybatis