#include<stdio.h>
#define M 5
typedef struct
{
int data1[M];
int top;
}stack;
typedef struct
{
int data2[M];
int front,rear;
}queue;
queue a;
stack b;
void main()
{
printf("请输入队列中的元素/n");
for(a.rear=0;a.rear<M;a.rear++)
{
scanf("%d",&a.data2[a.rear]);
}
printf(" 队列中的元素为/n");
while(a.rear)
{
printf("%3d",a.data2[M-a.rear]);a.rear--;
}
printf("/n将其入栈/n");
for(b.top=0;b.top<M;b.top++)
{
b.data1[b.top]=a.data2[a.rear];
a.rear++;
}
printf("/n出栈后的结果为/n");
for(b.top;b.top>=0;b.top--)
{
printf("%d",b.data1[b.top-1]);
}
}