yanghui.cpp

根据数据结构教材

#include <stdio.h> 
#include <stdlib.h>
#include <iostream.h>

#define TRUE       1
#define FALSE      0
#define OK         1
#define ERROR      0
#define OVERFLOW   -1 

typedef int QElemType;
typedef int Status;  

#define MAXQSIZE	100
typedef struct{
		QElemType	* base;
		int front;
		int rear;
}SqQueue;

//队列初始化
Status InitQueue(SqQueue &Q)
{
	Q.base=(QElemType *)malloc(MAXQSIZE * sizeof(QElemType));
	if(!Q.base)exit(OVERFLOW);
	Q.front=Q.rear=0;
	return OK;
}

//队列长度
int QueueLength(SqQueue Q)
{
	return(Q.rear-Q.front+MAXQSIZE)%MAXQSIZE;
}

//插入队尾元素
Status EnQueue(SqQueue&Q,QElemType e)
{
	if((Q.rear+1)%MAXQSIZE==Q.front)return ERROR;
	Q.base[Q.rear]=e;
	Q.rear=(Q.rear+1)%MAXQSIZE;
	return OK;
}

//删除对头元素
Status DeQueue(SqQueue &Q,QElemType &e)
{
	if(Q.front==Q.rear)return ERROR;
	e=Q.base[Q.front];
	Q.front=(Q.front+1)%MAXQSIZE;
	return OK;
}


void YangHui(int n)
{
	SqQueue Q;
	InitQueue(Q);
	EnQueue(Q,1);
	EnQueue(Q,1);
	int s=0,t;
	for(int i=1;i<=n;i++)
	{
		cout<<endl;
        EnQueue(Q,0);
		for(int j=1;j<=i+2;j++)
		{
			t=1;
			DeQueue(Q,t);
			EnQueue(Q,s+t);
			s=t;
			if(j!=i+2)cout<<s<<' ';
			
        }
	}
}

void main()
{
    int n;
	cout<<"输入次数：";
	cin>>n;
	YangHui(n);
}