程序设计大赛—Booklet Printing

程序设计大赛 —Booklet Printing

When printing out a document,normally the firstpage is printed first,then the second,them 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 regulat book.For example,a 4-page booklet would print on 1 sheet of page:the front will contain page 4 then page 1,and the back will contain page 2 and page 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 file 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 Blank in place of a number.if the front or back of a sheet is entirely blank,do noe generate output for that side of the sheet.Output must be in ascending order by sheet,front first,then back.

My program:

/*************************************************

程序名： Booklet Printing

作者：许文发

时间： 2009-11-24

*************************************************/

#include<iostream.h>

#include<stdio.h>

#include<string.h>

int first=1; // 第一次输出标志

// 获取所需的总页数

int sheetnum(int pages)

{

int m,n;

int num;

m=pages/4;

n=pages%4;

if(n==0)

num=m;

else

num=m+1;

return num;

}

// 打印处理

void print(int book[],int num,int pages)

{

int pagenum=1;

int i;

for(i=1;i<=num*4;i++)

{

if(i%4==2 || i%4==3 && pagenum<=pages)

book[i-1]=pagenum++;

}

for(i=num*4;i>=0;i--)

{

if((i%4==1 || i%4==0)&& pagenum<=pages)

book[i-1]=pagenum++;

}

// 清空文件

void clearfile()

{

FILE *pt;

pt=fopen("output.txt","w");

fclose(pt);

}

// 写文件

void mywrite(int book[],int num,int pages,int first)

{

FILE *pt;

pt=fopen("output.txt","a");

int i;

int fro_back=1;

int firstpage=1;

int pageblank=0;

if(first)

fprintf(pt,"Printing order for %d pages:/n",pages);

else

fprintf(pt,"/nPrinting order for %d pages:/n",pages);

for(i=0;i<num*4;i++)

{

if(book[i]==0 && book[i+1]==0)

{

pageblank=1;

}

else

{

pageblank=0;

}

if(pageblank)

{

}

else

{

if(fro_back==1)

{

fro_back=0;

if(firstpage)

{

fprintf(pt,"Sheet %d, front:",i/4+1);

firstpage=0;

}

else

fprintf(pt,"/nSheet %d, front:",i/4+1);

if(book[i]==0)

fprintf(pt," Blank,");

else

fprintf(pt," %d,",book[i]);

if(0==book[i+1])

fprintf(pt," Blank");

else

fprintf(pt," %d",book[i+1]);

}

else

{

fro_back=1;

fprintf(pt,"/nSheet %d, back:",i/4+1);

if(book[i]==0)

fprintf(pt," Blank,");

else

fprintf(pt," %d,",book[i]);

if(0==book[i+1])

fprintf(pt," Blank");

else

fprintf(pt," %d",book[i+1]);

}

i++;

}

void main()

{

clearfile();

int pages;

int book[100];

FILE *pt;

if(NULL==(pt=fopen("input.txt","r")))

{

}

else

{

fscanf(pt,"%d",&pages);

while(pages!=0)

{

memset(book,0,100);

print(book,sheetnum(pages),pages);

mywrite(book,sheetnum(pages),pages,first);

first=0;

fscanf(pt,"%d",&pages);

}

fclose(pt);

}

Input:

Output:

Printing order for 1 pages:

Sheet 1, front: Blank, 1

Printing order for 2 pages:

Sheet 1, front: Blank, 1

Sheet 1, back: 2, Blank

Printing order for 3 pages:

Sheet 1, front: Blank, 1

Sheet 1, back: 2, 3

Printing order for 4 pages:

Sheet 1, front: 4, 1

Sheet 1, back: 2, 3

Printing order for 5 pages:

Sheet 1, front: Blank, 1

Sheet 1, back: 2, Blank

Sheet 2, front: Blank, 3

Sheet 2, back: 4, 5

Printing order for 6 pages:

Sheet 1, front: Blank, 1

Sheet 1, back: 2, Blank

Sheet 2, front: 6, 3

Sheet 2, back: 4, 5

Printing order for 7 pages:

Sheet 1, front: Blank, 1

Sheet 1, back: 2, 7

Sheet 2, front: 6, 3

Sheet 2, back: 4, 5

Printing order for 8 pages:

Sheet 1, front: 8, 1

Sheet 1, back: 2, 7

Sheet 2, front: 6, 3

Sheet 2, back: 4, 5

Printing order for 9 pages:

Sheet 1, front: Blank, 1

Sheet 1, back: 2, Blank

Sheet 2, front: Blank, 3

Sheet 2, back: 4, 9

Sheet 3, front: 8, 5

Sheet 3, back: 6, 7

Printing order for 10 pages:

Sheet 1, front: Blank, 1

Sheet 1, back: 2, Blank

Sheet 2, front: 10, 3

Sheet 2, back: 4, 9

Sheet 3, front: 8, 5

Sheet 3, back: 6, 7

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

程序设计大赛—Booklet Printing相关推荐

HDU 6114 Chess 【组合数】（2017百度之星程序设计大赛 - 初赛（B））
Chess Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Subm ...
hdu6383（2018 “百度之星”程序设计大赛 - 初赛（B））
p1m2 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Sub ...
hdu6380（2018 “百度之星”程序设计大赛 - 初赛（B））
degree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total S ...
hdu6375（2018 “百度之星”程序设计大赛 - 初赛（A））
度度熊学队列 Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total S ...
2018百度之星程序设计大赛 - 资格赛 hdu6345（找区间最小值）
子串查询 Time Limit: 3500/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Sub ...
nyoj1237 最大岛屿(河南省第八届acm程序设计大赛)
题目1237 题目信息执行结果本题排行讨论区最大岛屿时间限制:1000 ms | 内存限制:65535 KB 难度:2 描写叙述神奇的海洋.惊险的探险之路,打捞海底宝藏,激烈的海战,海 ...
NYOJ--1236--挑战密室(第八届河南省程序设计大赛)
挑战密室时间限制:1000 ms | 内存限制:65535 KB 难度:4 描述 R组织的特工Dr. Kong 为了寻找丢失的超体元素,不幸陷入WTO密室.Dr. Kong必须尽快找到解锁密码逃 ...
2017百度之星程序设计大赛 - 复赛 01，03，05
Arithmetic of Bomb Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Other ...
2019 年百度之星·程序设计大赛 - 初赛一 C. HDU 6670 Mindis 离散化+dijkstra
题目链接 :http://acm.hdu.edu.cn/showproblem.php?pid=6670 Mindis Time Limit: 4000/2000 MS (Java/Others) M ...

程序设计大赛—Booklet Printing

程序设计大赛—Booklet Printing相关推荐

最新文章

热门文章