#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_PRODUCT_NUM 50
typedef struct
{
char num[20];//产品编号
char name[20];//名称
char vender[20];//厂家
char time[20];//日期
float price;//价格
}PRODUCT;
PRODUCT p[MAX_PRODUCT_NUM];
int p_num=0;
int Select_Menu()
{
int chioce;
do
{
system("cls");
printf("1:产品信息录入\n");
printf("2:产品信息浏览\n");
printf("3:按生产时间排序\n");
printf("4:按生产时间查询\n");
printf("0:退出\n");
printf("请输入选择:\n");
scanf("%d",&chioce);
if(chioce<0||chioce>4)
{
printf("请重新选择!\n");
scanf("%d",&chioce);
}
}while(chioce<0||chioce>4);
return chioce;
}
void Add_New_Product()
{
system("cls");
printf("请输入产品编号:\n");
scanf("%s",&p[p_num].num);
printf("请输入产品名称:\n");
scanf("%s",&p[p_num].name);
printf("请输入生产厂家:\n");
scanf("%s",&p[p_num].vender);
printf("请输入生产日期(year/mon):\n");
scanf("%s",&p[p_num].time);
printf("请输入价格:\n");
scanf("%f",&p[p_num].price);
p_num++;
printf("新增产品信息成功!\n");
system("pause");
}
void Print_Product(PRODUCT* q,int n)
{
int i;
for(i=0;i<n;i++)
{
printf("%-20s%-20s%-20s%-10s%-10g\n",q[i].num,q[i].name,q[i].vender,q[i].time,q[i].price);
}
}
void Sort_Product_Time()
{
PRODUCT temp;
int i,j;
for(i=0;i<p_num;i++)
{
for(j=i+1;j<p_num;j++)
{
if( strcmp(p[i].time,p[j].time)<0 )
{
temp=p[j];
p[j]=p[i];
p[i]=temp;
}
}
}
}
void Search_Product_Time()
{
char temp[20];
int i,flag=1;
system("cls");
printf("请输入要查询的生产日期(year/mon):\n");
scanf("%s",temp);
for(i=0;i<p_num;i++)
{
if(!strcmp(p[i].time,temp))
{
if(flag){printf("%-20s%-20s%-20s%-10s%-10s\n","编号","名称","厂家","生产日期","价格");flag=0;}
Print_Product(p+i,1);
}
}
if(flag)
{
printf("无信息!\n");
}
system("pause");
}
int main()
{
int n;
do
{
n=Select_Menu();
switch(n)
{
case 1:
Add_New_Product();
break;
case 2:
system("cls");
printf("%-20s%-20s%-20s%-10s%-10s\n","编号","名称","厂家","生产日期","价格");
Print_Product(p,p_num);
system("pause");
break;
case 3:
Sort_Product_Time();
system("cls");
printf("%-20s%-20s%-20s%-10s%-10s\n","编号","名称","厂家","生产日期","价格");
Print_Product(p,p_num);
system("pause");
break;
case 4:
Search_Product_Time();
break;
}
}while(n!=0);
return 0;
}
产品生产时间管理
最新推荐文章于 2023-07-06 02:37:11 发布