POJ 1313 Booklet Printing G++ 模拟 背

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
//英语      看博友分析     抄博友程序      模拟     背 
struct nod{
	int front1;
	int front2;
	int back1;
	int back2; 
};
nod da[200];
int n; 
void p(int x)
{
	if(x>n)//抄博友程序 
	{
		cout<<"Blank";
	}else
	{
		cout<<x;
	}
}
int main()
{
	while(1)
	{
		memset(da,0,sizeof(da));
		//int n;
		cin>>n;
		if(n==0)
		{
			break;
		}
		int num;
		if(n%4==0)
		{
			num=n/4;
		}else 
		{
			num=n/4+1;
		}
		int cnt=0;
		for(int i=0;i<num;i++)
		{
			da[i].front2=++cnt;
			da[i].back1=++cnt;
		}
		for(int i=num-1;i>=0;i--)
		{
			da[i].back2=++cnt;
			da[i].front1=++cnt;
		}
		cout<<"Printing order for "<<n<<" pages:"<<endl;
		for(int i=0;i<num;i++)
		{
			cout<<"Sheet "<<i+1<<", front: ";
			p(da[i].front1);
			cout<<", ";
			p(da[i].front2);
			cout<<endl;
			if(da[i].back1>n && da[i].back2>n)
			{
				continue;
			}
			cout<<"Sheet "<<i+1<<", back : ";//抄博友程序 
			p(da[i].back1);
			cout<<", ";
			p(da[i].back2);
			cout<<endl;			
		}
	}
	return 0;
}