Edge

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


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

 

今天晚上哥哥也是醉了，熬夜到這時候，不負所望，AC之，其實這個題看起來高大上的樣子，讀了三遍才懂它什麼意思。不過我的解法確實很麻煩，但雖然寫的那麼復雜，唉 起碼鍛煉思維邏輯能力了；

提交上去後，是各位小伙子們簡直理解不了的亢奮哦！不知道最近瘋狂的愛上acm了，以至於天天都不願意去上課了丫的。接下來的代碼看起來很苯蛋的樣子，自己都服了。媽的。

上代碼：

#include
using namespace std;
#include
int main()
{
	int t[200],k[200];
	string str1;
	string str[]={"moveto","lineto"};
	while(cin>>str1)
	{
		 t[0]=300;k[0]=420;
		 t[1]=310;k[1]=420;
		 int flag=0;
		cout<