USTC 1005 Booklet Printing

Problem 1005
Booklet Printing
Time Limit: 1000ms
Memory Limit: 65536kb
Description
When printing out a document, normally the first page is printed first, then the second, then the third, and so on until the end. However, when creating a fold-over booklet, the order of printing must be altered. A fold-over booklet has four pages per sheet, with two on the front and two on the back. When you stack all the sheets in order, then fold the booklet in half, the pages appear in the correct order as in a regular book. For example, a 4-page booklet would print on 1 sheet of paper: the front will contain page 4 then page 1, and the back will contain page 2 then page 3.
Front              Back
-------------      -------------
|     |     |      |     |     |
|  4  |  1  |      |  2  |  3  |
|     |     |      |     |     |
-------------      -------------
Your task is to write a program that takes as input the number of pages to be printed, then generates the printing order.
Input
The input contains one or more test cases, followed by a line containing the number 0 that indicates the end of the file. Each test case consists of a positive integer n on a line by itself, where n is the number of pages to be printed; n will not exceed 100.
Output
For each test case, output a report indicating which pages should be printed on each sheet, exactly as shown in the example. If the desired number of pages does not completely fill up a sheet, then print the word Blank in place of a number. If the front or back of a sheet is entirely blank, do not generate output for that side of the sheet. Output must be in ascending order by sheet, front first, then back.
Sample Input
1
14
4
0
Sample Output
Printing order for 1 pages:
Sheet 1, front: Blank, 1
Printing order for 14 pages:
Sheet 1, front: Blank, 1
Sheet 1, back : 2, Blank
Sheet 2, front: 14, 3
Sheet 2, back : 4, 13
Sheet 3, front: 12, 5
Sheet 3, back : 6, 11
Sheet 4, front: 10, 7
Sheet 4, back : 8, 9
Printing order for 4 pages:
Sheet 1, front: 4, 1
Sheet 1, back : 2, 3
。。。。。。

                                                               -_-#

#include<stdio.h>
#include<string.h>
#define N 505
#define L 0
#define Y 1
#define E 2
#define S 4
#define _M_ main()
#define _ i
#define __ n
#define ___ k
#define ____ num
#define _____ [_]
#define ______ [L]
#define _______ [Y]
#define ________ [E]
#define _________ if(___>n) break;
#define __________ page
#define ___________ front
#define ____________ back
#define _____________ __________ _____.___________
#define ______________ __________ _____.____________
#define _______________ __________ _____.___________ ______
#define ________________ __________ _____.___________ _______
#define _________________ __________ _____.____________ ______
#define __________________ __________ _____.____________ _______
#define ___________________ ___++
#define ____________________ _--
#define _____________________ _++
#define ______________________ %S
#define _______________________ /S
#define ________________________ _+Y
#define _________________________ +Y
#define __________________________ -Y
#define ___________________________ =Y
#define ____________________________ =L
#define _____________________________ ==L
#define ______________________________ >=L
#define _______________________________ __ _______________________
#define ________________________________ scanf
#define _________________________________ printf
#define __________________________________ memset
#define ___________________________________ "Printing order for %d pages:\n"
#define ____________________________________ "Sheet %d, front: Blank, %d\n"
#define _____________________________________ "Sheet %d, front: %d, Blank\n"
#define ______________________________________ "Sheet %d, front: %d, %d\n"
#define _______________________________________ "Sheet %d, back : Blank, %d\n"
#define ________________________________________ "Sheet %d, back : %d, Blank\n"
#define _________________________________________ "Sheet %d, back : %d, %d\n"
int _M_
{
	struct
	{
		int ___________ ________;
		int ____________ ________;
	}__________[N];
	int _,__,___,____;
	while(________________________________("%d",&__),__)
	{
		for(_ ____________________________;_<N;_____________________)
			__________________________________(_____________,L,sizeof(_____________)),__________________________________(______________,L,sizeof(______________));
		if(__ ______________________ _____________________________) ____=_______________________________;
		else ____=_______________________________ _________________________;
		___  ___________________________;
		for(_ ____________________________;_<____;_____________________)
		{
				  ________________=___________________;
			_________ _________________=___________________;
			_________
		}
		for(_=____ __________________________;_ ______________________________;____________________)
		{
			_________ __________________=___________________;
			_________ _______________=___________________;
			_________
		}
		_________________________________(___________________________________,__);
		for(_ ____________________________;_<____;_____________________)
		{
			if(_______________||________________)
			{
				if(_______________ _____________________________) _________________________________(____________________________________,________________________,________________);
				else if(________________ _____________________________) _________________________________(_____________________________________,________________________,_______________);
				else _________________________________(______________________________________,________________________,_______________,________________);
			}
			if(_________________||__________________)
			{
				if(_________________ _____________________________) _________________________________(_______________________________________,________________________,__________________);
				else if(__________________ _____________________________) _________________________________(________________________________________,________________________,_________________);
				else _________________________________(_________________________________________,________________________,_________________,__________________);
			}
		}
	}
	return L;
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值