顺序栈实现学生管理系统

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define Maxsize 100
struct student
{
    char number[20];
    char name[20];
    char sex[10];
    int age;
    char examtype[20];
};
typedef struct student ElemType;
typedef struct Stack
{
    ElemType data[Maxsize];
    int top;
} MyStack;
void CreateStack(MyStack *&S)
{
    int n;
    S=(MyStack*)malloc(sizeof(MyStack));
    S->top=-1;//初始化栈
    printf("请输入考生人数：\n");
    scanf("%d",&n);
    printf("请输入考生信息：\n");
    for(int i=0; i<n; i++,S->top++)
    {
        scanf("%s%s%s%d%s",S->data[i].number,S->data[i].name,S->data[i].sex,&S->data[i].age,S->data[i].examtype);
    }
    printf("创建成功！\n");
}
void DisStack(MyStack*S)
{
    int k=S->top+1;
    int m=S->top;
    for(int i=0; i<k; i++)
    {
        printf("%s %s %s %d %s\n",S->data[m].number,S->data[m].name,S->data[m].sex,S->data[m].age,S->data[m].examtype);
        m--;
    }
}
void AddStack(MyStack *S)
{
    int n;
    printf("请输入要增加的人数：\n");
    scanf("%d",&n);
    printf("请输入要增加的考生信息：\n");
    for(int i=0; i<n; i++)
    {
        scanf("%s%s%s%d%s",S->data[S->top+i+1].number,S->data[S->top+i+1].name,S->data[S->top+i+1].sex,&S->data[S->top+i+1].age,S->data[S->top+i+1].examtype);
    }
    S->top+=n;
    printf("增加成功！\n");
}
void RiverseStack(MyStack *S)//修改
{
    char num[20];
    printf("请输入要修改的考生号：\n");
    scanf("%s",num);
    for(int i=0; i<=S->top; i++)
    {
        if(strcmp(S->data[i].number,num)==0)
        {
            printf("请重新输入考生信息(考号，姓名，性别，年龄，报考类别)：\n");
            scanf("%s%s%s%d%s",S->data[i].number,S->data[i].name,S->data[i].sex,&S->data[i].age,S->data[i].examtype);
        }
    }
    printf("修改成功！\n");
}
void DeleteStack(MyStack*S)
{
    ElemType temp;
    char num[20];
    printf("请输入要删除的考生号：\n");
    scanf("%s",num);
    for(int i=0; i<=S->top; i++)
    {
        if(strcmp(S->data[i].number,num)==0)
        {
            temp=S->data[i];
            for(int j=i; j<=S->top; j++)
            {
                S->data[j]=S->data[j+1];
            }
            S->top--;
        }
    }
    printf("删除成功！\n");
}
void SearchStack(MyStack*S)
{
    char num[20];
    printf("请输入要查找的考生号：\n");
    scanf("%s",num);
    for(int i=0; i<=S->top; i++)
    {
        if(strcmp(S->data[i].number,num)==0)
        {
            printf("%s %s %s %d %s\n",S->data[i].number,S->data[i].name,S->data[i].sex,S->data[i].age,S->data[i].examtype);
        }
    }

}
int main()
{
    MyStack *s;
    CreateStack(s);
    DisStack(s);
    AddStack(s);
    DisStack(s);
    RiverseStack(s);
    DisStack(s);
    DeleteStack(s);
    DisStack(s);
    SearchStack(s);
    DisStack(s);
    printf("当前栈顶指针是：%d",s->top);
    return 0;
}