#include<stdio.h>
#define maxsize 20
struct guest
{
char name[8]; //姓名
int sum; //人数
char time[10]; //时间
char number; //序号
}guest[maxsize];
/*----------插入---------*/
void insert(int *count)
/* 形参取指针变量*count,若不传递地址,
则count值无法改变,形参无法改变实参*/
{
int i,in_number;
if(*count==maxsize)
{
printf("memeory is full");
return;
}
printf("insert number:");
scanf("%d",&in_number);
for(i=0;i<*count;i++)
if(guest[i].number==in_number)
{
printf("there is already one");
return;
}
guest[i].number=in_number;
printf("name:");
scanf("%s",&guest[i].name);
printf("sum:");
scanf("%d",&guest[i].sum);
printf("time:");
scanf("%s",&guest[i].time);
(*count)++;
}
/*--------修改--------*/
void update(int count)
{
int i,number,flag=1;
printf("update number:");
scanf("%d",&number);
for(i=0;i<count;i++)
if(guest[i].number==number)
{
printf("number:");
scanf("%d",&guest[i].number);
printf("time:");
scanf("%s",&guest[i].time);
flag=0;
}
if(flag==0)
printf("nothing,silly me\n");
}
/*---------查询---------*/
void search(int count)
{
int i,number;
printf("search number:");
scanf("%d",&number);
for(i=0;i<count;i++)
{
if(guest[i].number==number)
{
printf("姓名:%s",guest[i].name);
printf("人数:%d",guest[i].sum);
printf("时间:%s",guest[i].time);
}
else
printf("nothing,silly me");
}
}
/*---------删除----------*/
void Delete(int *count)
{
int i,j,number;
printf(" delete number:");
scanf("%d",&number);
for(i=0;i<*count;i++)
{
if(guest[i].number==number)
{
for(j=i;j<*count;j++)
{
guest[j]=guest[j+1];
}
(*count)--;
}
else
printf("nothing,silly me");
}
}
/*-------显示--------*/
void show(int count)
{
int i;
printf("\n");
printf("编号 姓名 人数 吃饭时间\n");
for(i=0;i<count;i++)
{
printf("%10d",guest[i].number);
printf("%12s",guest[i].name);
printf("%10d",guest[i].sum);
printf("%12s\n",guest[i].time);
}
}
/*--------main-----*/
void main()
{
int i,count=0;
do
{
printf("Please choose the following number\n");
printf("1---插入(insert)\n");
printf("2---修改(update)\n");
printf("3---查询(search)\n");
printf("4---删除(delete)\n");
printf("5---显示(show)\n");
printf("6---退出(exist)\n");
scanf("%d",&i);
switch(i)
{
case 1:insert(&count);
break;
case 2:update(count);
break;
case 3:search(count);
break;
case 4:Delete(&count);
break;
case 5:show(count);
break;
case 6:break;
default:
printf("choose again");
}
}
while(i!=6);
}
订餐系统处理
最新推荐文章于 2023-12-02 22:15:26 发布