#include <stdio.h>
#define Max 100

void SetNull(front, rear)
int *front, *rear;
{
	*front = 0;
	*rear = 0;
}

int Empty(front,rear)
int *front, *rear;
{
	if(*front == *rear)
		return(1);
	else
		return(0);
}

int EnQueue(q,x,front,rear)
int q[];
int x;
int *front,*rear;
{
	*rear = (*rear+1) % Max;
	if(*front == *rear)

	{
		printf("隊(duì)列發(fā)生上溢\n");
		return(-1);
	}
	else
	{
		q[*rear] = x;
		return(0);
	}
}

int DelQueue(q,y,front,rear)
int q[];
int *y;
int *front,*rear;
{
	*front = (*front +1)%Max;
	if(*front == *rear)
	{
		printf("隊(duì)列發(fā)生下溢\n");
		return(-1);
	}
	else
	{
		*y = q[*front];
		return(0);
	}
}

void main()
{
	int q[Max];
	int f = 0, r = 0;	/*f和r分別對應(yīng)隊(duì)列的頭和尾在整個(gè)隊(duì)列存儲(chǔ)區(qū)域的位置*/
	int i,x,m,n;
	int a;
	SetNull(&f,&r);			/*清空隊(duì)列*/
	printf("要輸入隊(duì)列的字符個(gè)數(shù)：\n");
	scanf("%d",&m);
	printf("輸入隊(duì)列的整型數(shù)據(jù)：\n");
	for (i=0; i<m; i++)
	{
		i=i;
		scanf("%d",&x);
		a = EnQueue(q,x,&f,&r);
		if(a == -1)
			break;
	}
	printf("要提出隊(duì)列的字符個(gè)數(shù)：");
	scanf("%d",&n);
	printf("輸出從隊(duì)列中提取的數(shù)據(jù)：\n");
	for (i = 0; i<n; i++)
	{
		if(DelQueue(q,&x,&f,&r) == -1)
			break;
		printf("%d\n",x);
	}
	if(Empty(&f,&r) == 1)
		printf("隊(duì)列為空");
	else
		printf("隊(duì)列中還有%d個(gè)數(shù)據(jù)",(m-n));
}