2013
11-26

# 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

#include<stdio.h>
#include<string.h>
#include<stdio.h>
#include<iostream>
using namespace std;
char st[205];
int flag,x,y;
void move(int &x,int &y,int &flag,char dict){
if(flag==0){
if(dict=='A'){
x=x+10;
y=y;
flag=1;
}
else{
x=x-10;
y=y;
flag=3;
}
}
else if(flag==1){
if(dict=='A'){
x=x;
y=y-10;
flag=2;
}
else{
x=x;
y=y+10;
flag=0;
}
}
else if(flag==2){
if(dict=='A'){
x=x-10;
y=y;
flag=3;
}
else{
x=x+10;
y=y;
flag=1;
}
}
else{
if(dict=='A'){
x=x;
y=y+10;
flag=0;
}
else{
x=x;
y=y-10;
flag=2;
}
}
}
int main(){
while(scanf("%s",&st)!=EOF){
printf("300 420 moveto\n310 420 lineto\n");
int len=strlen(st);
flag=1;
int i;
x=310;y=420;
for(i=0;i<len;i++){
move(x,y,flag,st[i]);
printf("%d %d lineto\n",x,y);
}
printf("stroke\nshowpage\n");
}
return 0;
}

1. 我没看懂题目
2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5
我觉得第一个应该是5 6 -1 5 4 输出是19 5 4
第二个是7 0 6 -1 1 -6 7输出是14 7 7
不知道题目例子是怎么得出来的

2. 第一句可以忽略不计了吧。从第二句开始分析，说明这个花色下的所有牌都会在其它里面出现，那么还剩下♠️和♦️。第三句，可以排除2和7，因为在两种花色里有。现在是第四句，因为♠️还剩下多个，只有是♦️B才能知道答案。