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.
大致思路:
看着挺复杂其实就是一个模拟,给定一个初始坐标,然后根据提示每次向哪个方向前进一段路程。
代码:
#include<stdio.h>
#include<string.h>
const int MAXN=200;
char str[MAXN];
int main()
{
    int x,y;
    while(scanf("%s",&str)!=EOF)
    {
        int len=strlen(str);
        int x=310,y=420;
        int p=1;
        printf("300 420 moveto\n310 420 lineto\n");
        for(int i=0;i<len;i++)
        {
            switch(p)
            {
                case 1:
                     if(str[i]=='V') p=2,y+=10;
                     else p=-2,y-=10;
                     break;
                case 2:
                     if(str[i]=='V') p=-1,x-=10;
                     else p=1,x+=10;
                     break;
                case -1:
                     if(str[i]=='V') p=-2,y-=10;
                     else p=2,y+=10;
                     break; 
                case -2:
                     if(str[i]=='V') p=1,x+=10;
                     else p=-1,x-=10;
                     break;
            }    
            printf("%d %d lineto\n",x,y);
        }    
        printf("stroke\nshowpage\n");
 
    }    
    return 0;
    
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值