Edge

题目名称：Edge

题目链接：Edge

描述

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.

输入

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.

输出

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.

样例输入

V
AVV

样例输出

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

题目大意

给你一个起点和移动方向，第一次所在位置为(300,420),向右移动到(310,420)，接下来给定A(顺时针）和V（逆时针）方向旋转继续前进，求点经过的路径

解题思路

分别创建数组dx和dy表示四个方向，下标index表示当前所指向的方向，分别根据顺时针和逆时针来改变下标index所在位置来控制方向

代码如下

#include<iostream>
#include<cstdio>
using namespace std;
int dx[4]={10,0,-10,0};
int dy[4]={0,10,0,-10};
char str[210];

int main()
{
   while(cin>>str){
   	int x=310,y=420;
   	printf("300 420 moveto\n310 420 lineto\n");	
   	int index=0;
   	for(int i=0;str[i];i++){
   	    if(str[i]=='V'){
   	    	index=(index+1)%4;
   	    }else{
   	    	index=(index+3)%4;
   	    }
   	    x+=dx[index];
   	    y+=dy[index];
   	    printf("%d %d lineto\n",x,y);
   	}
   	printf("stroke\nshowpage\n");
   }
   return 0;
}

写在最后

这道题让我想起来去年一道ACM网络赛的题目，和这个类似，可惜当时由于各种原因没写出来，好后悔，不然就可以去参加现场赛了