堆栈数据结构的实现~

写地很垃圾的一段代码，实现堆栈操作

#define MAX 100
#include<stdio.h>

 int i = 0;
 int stack[MAX];

void push(int n)
{

 if(i >= MAX)
 {
  printf("Stack overflow!/n");
 return;
 }
 stack[i] = n;
 i++;
}

void pop()
{
 if(i <= 0 )
 {
  printf("Stack underflow!/n");
  return ;
 }
 i--;
  printf( "The top of the stack is %d/n",stack[i]);
}

int empty()
{
 if(i < 0)
  return 1;
 else
  return 0;
}
/*=================================================================*/
int
main()
{
 int j,n;
 int m=-1;
 while(m != 0){
 printf("Please choose:/n");
 printf("1) Push a number into stack/n");
 printf("2) Pop the top of the stack/n");
 printf("3) exit/n");

 scanf("%d",&j);

 if(j <1 || j > 3)
 printf("Error,Please choose a right number!");

 switch(j)
 {
 case 1: printf("Please input the number you want do push:/n");
  scanf("%d",&n);
  push(n);
  break;

 case 2: pop();
  break;

 case 3: m = m+1;
 }
 }
}