#include<stdio.h>
#include<stdlib.h>
#define MAX 20
#define ElemType int
#define S  (*p)

struct SqStack
{
	ElemType elem[MAX];
	int top;
};

main()
{
	struct SqStack *q;
	int i,y,cord;ElemType a;
	void OutStack(struct SqStack S);
	void InitStack(struct SqStack *p);
	void Push(struct SqStack *p,ElemType x);
	ElemType Pop(struct SqStack *p);
	ElemType GetTop(struct SqStack *p);
	do{
		printf("\n");
		printf("\n           主菜單          \n");
		printf("\n     1     初始化順序棧    \n");
		printf("\n     2     插入一個(gè)元素    \n");
		printf("\n     3     刪除棧頂元素    \n");
		printf("\n     4     取棧頂元素      \n");
		printf("\n     5     結(jié)束程序運(yùn)行    \n");
		printf("\n--------------------------------\n");
		printf("請(qǐng)輸入您的選擇( 1, 2, 3, 4, 5)");
		scanf("%d",&cord);
		switch(cord)
		{
			case 1:
				{
					q=(struct SqStack*)malloc(sizeof(struct SqStack));
					InitStack(q);
					OutStack(q);
				}break;
			case 2:
				{
					printf("請(qǐng)輸入要插入的數(shù)據(jù) a=");
					scanf("%d",&a);
					Push(q,a);
					OutStack(q);
				}break;
			case 3:
				{
					Pop(q);
					OutStack(q);
				}break;
			case 4:
				{
					y=GetTop(q);
					printf("\ny=%d\n",y);
					OutStack(q);
				}break;
			case 5:
				exit(0);
		}
	}while (cord<=5);
}

void InitStack(struct SqStack *p)
{
	if(!p)
		printf("Eorror");
	S.top=0;
}

void Push(struct SqStack *p,ElemType x)
{
	if(S.top<MAX-1)
	{
		S.top=S.top+1;
		S.elem[S.top]=x;
	}
	else
		printf("Overflow!\n");
}

ElemType Pop(struct SqStack *p)
{
	ElemType x;
	if(S.top!=0)
	{
		x=S.elem[S.top];
		S.top=S.top-1;
		return(x);
	}
	else
	{
		printf("Underflow!\n");
		return(0);
	}
}

ElemType GetTop(struct SqStack *p)
{
	ElemType x;
	if(S.top!=0)
	{
		x=S.elem[S.top];
		return(x);
	}
	else
	{
		printf("Underflow!\n");
		return(0);
	}
}

void OutStack(struct SqStack *p)
{
	int i,j;
	if(S.top==0)
		printf("The stack is null");
	for(i=S.top;i>0;i--)
		printf("%2d %6d\n",i,S.elem[i]);
}