超市管理系統(tǒng)程序.doc

/* 超市管理系統(tǒng)程序*/*董能相*/#include#include#define MAX 20#define N 3#define PAGE 2#define PRINT1 printf(-n);#define PRINT2 printf(商品號(hào)-商品名稱-商品種類-銷售價(jià)格-生產(chǎn)日期(年-月-日)-保質(zhì)期n);#define PRINT3 printf(%4d%8s%8s%8d%15d%15d%15-2%d-2%d%10dn,goodsi.num,,goodsi.kind,goodsi.in_price,goodsi.out_price,_time,goodsi.save_day)int sum;/*用來(lái)記錄商品數(shù)目*/*日期結(jié)構(gòu)體類型*/struct date int year; int month; int date; ;/*商品結(jié)構(gòu)體類型*/struct goods_type int num; /* 商品數(shù)量*/ char name10; /*商品名稱*/ char kind10; /*商品種類*/ int amount; /*商品總量*/ int left_amount;/*商品剩余數(shù)量*/ int total_price; /*商品總價(jià)格*/ int goods_up; /*商品上限*/ int goods_down; /* 商品下限 */ int in_price; /*進(jìn)貨價(jià)格*/ int out_price; /*銷售價(jià)格*/ int in_num; /*進(jìn)貨數(shù)量*/ int out_num; /*售出數(shù)量*/ struct date in_time;/* 進(jìn)貨日期*/ struct date pro_time; /*生產(chǎn)日期*/ char factory10; /*生產(chǎn)廠家*/ int save_day; /*保質(zhì)期 */ int profit; /* 獲得利潤(rùn)*/goodsMAX;/*存放MAX種商品記錄的結(jié)構(gòu)體數(shù)組*/*保存信息*/save_message(int sum) FILE*fp; int i; if(fp=fopen(supermarket.txt,wb)=NULL) printf(讀文件錯(cuò)誤!n); return; for(i=0;isum;i+) if(fwrite(&goodsi,sizeof(struct goods_type),1,fp)!=1) printf(寫(xiě)文件錯(cuò)誤!n); fclose(fp);/*輸入模塊*/input_message() int i=0,s=MAX; clrscr(); printf(nn錄入商品信息(最多%d種)n,s); printf(-n);do printf(n good%d,i+1); printf(n num:); scanf(%d,&goodsi.num); printf(n name:); scanf(%s,&); printf(n kind:); scanf(%s,&goodsi.kind); printf(n amount:); scanf(%d,&goodsi.amount); printf(n goods_up:); scanf(%d,&goodsi.goods_up); printf(n goods_down:); scanf(%d,&goodsi.goods_down); printf(n in_price:); scanf(%d,&goodsi.in_price); printf(n out_price:); scanf(%d,&goodsi.out_price); printf(n in_num:); scanf(%d,&goodsi.in_num); printf(n in_date(yyyy-mm-dd):); scanf(%d-%d-%d,&goodsi.in_time.year,&goodsi.in_time.month,&goodsi.in_time.date); printf(n pro_date(yyyy-mm-dd):); scanf(%d-%d-%d,&_time.year,&_time.month,&_time.date); printf(n factory:); scanf(%s,&goodsi.factory); printf(n save_day:); scanf(%d,&goodsi.save_day); i+;while(iMAX); printf(n-%d種商品信息輸入完畢!-n,i); sum=i; printf(n press any key return menu!); bioskey(0);/*讀取信息*/int read_message() FILE *fp; int i=0; if(fp=fopen(supermarket.txt,rb)=NULL) printf(nn*暫時(shí)還沒(méi)有任何庫(kù)存信息,按任意鍵進(jìn)入主菜單選擇基本信息的錄入!*n); return;while(feof(fp)!=1) fread(&goodsi,sizeof(struct goods_type),1,fp); if(goodsi.num=0) break; else i+; fclose(fp); return(i);/*輸出模塊*/void output_message() int i=0,j=0,count,page=1; clrscr(); printf(nn-%dnn,page); PRINT2; PRINT1;do if(goodsi.num!=0) j+; if(j%PAGE!=0) PRINT3; PRINT1; else PRINT3; PRINT1; if(goodsi+1.num!=0); printf(按任意鍵繼續(xù)!);bioskey(0); clrscr(); printf(nn-商品信息表-第%d頁(yè)nn,+page); PRINT2; PRINT1; i+;while(goodsi.num!=0); printf(press any key return menu!); bioskey(0);/*添加商品信息*/insert_message() int i=sum,j,flag=0; char choice; clrscr(); printf(nn 添加一種新商品n); printf(-n);do goodsi.num=+sum; printf(new num:%d,goodsi.num); printf(n name:); scanf(%s,); printf(n kind:); scanf(%s,goodsi.kind); printf(n amount:); scanf(%d,goodsi.amount); printf(n goods_up:); scanf(%d,goodsi.goods_up); printf(n goods_down:); scanf(%d,goodsi.goods_down); printf(n in_price:); scanf(%d,goodsi.in_price); printf(n out_price:); scanf(%d,goodsi.out_price); printf(n in_num:); scanf(%d,goodsi.num); printf(n in_time:); scanf(%d%d%d,goodsi.in_time.year,goodsi.in_time.month,goodsi.in_time.date); printf(n pro_time:); scanf(%d%d%d,_time.year, _time.month, _time.date); printf(n factory:); scanf(%s,goodsi.factory); printf(n save_day:); scanf(%d,goodsi.save_day); printf(要繼續(xù)嗎?(Y/N); choice=getch(); if(choice=Y|choice=y) printf(n 繼續(xù)!n); i+; flag=1; else flag=0;while(flag=1); printf(n press any key return menu!); bioskey(0);/*刪除商品信息*/del_message() int i=sum,j,flag=0; char choice; clrscr(); printf(nnn); printf(-n);do goodsi.num=-sum; printf(n num:); printf(n name:); scanf(%s,); printf(n kind:); scanf(%s,goodsi.kind); printf(n left_amount:); scanf(%d,goodsi.left_amount); printf(n total_price:); scanf(%d,goodsi.total_price); printf(n 要繼續(xù)嗎? (Y/N); choice=getch(); if(choice=Y|choice=y); printf(n 繼續(xù)!n); i+; flag=1;while(flag=1); printf(n press any key enter the menu!); bioskey(0);/*修改模塊*/revise_message() int i=0,choice,revise_num,flag; do clrscr(); printf(n input the number of the good :); scanf(%d,&revise_num); for(i=0;isum;i+) if(goodsi.num=revise_num) printf(n-n); PRINT1; PRINT2; PRINT3; printf(n 您要修改哪一項(xiàng)?n); printf(n 1.namen); printf(n 2.kindn); printf(n 3.out_pricen); printf(n 4.pro_timen); printf(n 5.save_dayn); printf(n please make your choice(1-5):); scanf(%d,&choice);switch(choice) case 1:printf(n name:); scanf(%s,&);break; case 2:printf(n kind:); scanf(%s,&goodsi.kind);break; case 3:printf(n out_price:); scanf(%d,&goodsi.out_price);break; case 4:printf(n pro_time:); scanf(%d%d%d,&_time.year,&_time.month, &_time.date);break; case 5:printf(n save_day:); scanf(%d,&goodsi.save_day);break; PRINT1; PRINT2; PRINT3;break;if(i=sum) printf(n該商品不存在!); bioskey(0); printf(nn 要繼續(xù)嗎?(Y/N); choice=getch(); if(choice=Y|choice=y) flag=1; printf(n 繼續(xù)!n); else flag=0;while(flag=1); printf(n press any key return menu!); bioskey(0);/*更新模塊*/renew_message() int choice;do clrscr(); printf(nnn*更新商品信息*nn); printf( 1.insert_messagenn); printf( 2.del_messagenn); printf( 3.revise_messagenn); printf( 0.return menunn); printf( please make your choice(0-3):); scanf(%d,&choice);switch(choice) case 1:insert_message();break; case 2:del_message();break; case 3:revise_message();break; case 0:break;while(choice!=0);/*按名稱查詢*/inquire_name() int i,choice,j=0,inquire_in_price; char inquire_name10; clrscr(); printf(n input the name of the good:); scanf(%s,inquire_name); for(i=0;isum;i+) if(strcmp(,inquire_name)=0&goodsi.num!=0) printf(n -商品信息-n); PRINT1; PRINT2; PRINT3; else j+; if(j=sum) printf(n 該商品不存在!); bioskey(0);/*按類別查詢*/inquire_kind() int i=0,choice,j=0,inquire_in_price; char inquire_kind10; clrscr(); printf(n input the kind of the good:); scanf(%s,inquire_kind); if(strcmp(goodsi.kind,inquire_kind)=0&goodsi.num=!0); printf(n -商品信息-n); PRINT1; PRINT2; PRINT3; if(j=sum) printf(n 該商品不存在!); bioskey(0); /*按進(jìn)貨時(shí)間查詢*/inquire_in_time() int i,choice,j=0,inquire_in_price; struct date in_time; clrscr(); printf(n input the in time of the good:); scanf(%d,inquire_in_time); for(i=0;isum;i+) if(goodsi.num!=0) printf(n-商品信息-n); PRINT1; PRINT2; PRINT3; else j+; if(j=sum) printf(該商品不存在!n); bioskey(0); /*按進(jìn)貨量查詢*/inquire_in_num() int i,choice,j=0,inquire_in_price; int inquire_in_num; clrscr(); printf(n input the in number of the good:); scanf(%d,inquire_in_time); for(i=0;isum;i+) if(goodsi.num!=0) printf(n-商品信息-n); PRINT1; PRINT2; PRINT3; else j+; if(j=sum) printf(該商品不存在!n); bioskey(0);/*查詢模塊*/inquire_message() int choice;do clrscr(); printf(nnn*查詢商品信息*nn); printf( 1.inquire_namenn); printf( 2.inquire_kindnn); printf( 3.inquire_in_timenn); printf( 4.inquire_in_numnn); printf( 0.return menunn); printf(please make your choice (0-4):); scanf(%d,&choice);switch(choice) case 1:inquire_name();break; case 2:inquire_kind();break; case 3:inquire_in_time();break; case 4:inquire_in_num();break; case 0:break; while(choice!=0);/*統(tǒng)計(jì)利潤(rùn)*/count_profit() int i,choice,j=0,count_num,profit; char inquire_name10; clrscr(); printf(n input the number of the good :); scanf(%d,&count_num); for(i=0;isum;i+) if(goodsi.num=count_num) profit=goodsi.out_price-goodsi.in_price; printf(n profit:); printf(n-n); printf(n num profit); printf(n%25d%13dn,goodsi.num,profit); else j+; if(j=sum) printf(n 該商品不存在!); bioskey(0);/*統(tǒng)計(jì)進(jìn)貨量*/count_in_num() int i,choice,j=0,count_num,in_num; char inquire_name10; clrscr(); printf(n input the amount of the good:); scanf(%d,&count_in_num); for(i=0;isum;i+) if(goodsi.in_num!=0) printf(n %dn,in_num); else j+; if(j=sum) printf(n 該商品不存在!); bioskey(0);/*統(tǒng)計(jì)庫(kù)存量*/count_full() int i,choic,j=0,count_num,full; int in_num; int out_num; char inquire_name10; clrscr(); printf(n input the number of the good:); scanf(%d,&count_full); for(i=0;isum;i+) if(goodsi.num!=0) full=goodsi.in_num-goodsi.out_num; printf(n full:); printf(n-n); printf(n num full); printf(n%25d%13dn,goodsi.num,full); else j+; if(j=sum) printf(n 該商品不存在!); bioskey(0);/*統(tǒng)計(jì)模塊*/count_message() int choice;do clrscr(); printf(nnn*統(tǒng)計(jì)商品信息*nn); printf( 1.count_profitnn); printf( 2.count_in_numnn); printf( 3.count_fullnn); printf( 0.return menunn); printf(please make your choice (0-3):); scanf(%d,&choice);switch(choice) case 1:count_profit();break; case 2:count_in_num();break; case 3:count_full();break; case 0:break; while(choice!=0);/*庫(kù)存排行*/sort_amount() struct goods_type *p,*qMAX; int i,j,k; clrscr(); printf(n 庫(kù)存排行 n); printf(-n); printf(n 排名 商品號(hào) 商品名稱 商品類別 庫(kù)存量n); p=goods; for(i=0;isum;i+) qi=p+; for(i=0;isum;i+) k=i; for(j=i+1;jamountamount) k=j; if(k!=i) qi=qi;qi=qk;qk=p; for(i=0;iname,qi-kind,qi-amount); bioskey(0);/*利潤(rùn)排行*/sort_profit() struct goods_type *p,*qMAX; int i,j,k; clrscr(); printf(n 利潤(rùn)排行 n); printf(-n); printf(n 排名 商品號(hào) 商品名稱 商品類別 利潤(rùn) n); p=goods; for(i=0;isum;i+) qi=p+; for(i=0;isum;i+) k=i; for(j=i+1;jprofitprofit) k=j; if(k!=i) qi=qi;qi=qk;qk=p; for(i=0;iname,qi-kind,qi-profit); bioskey(0);/*銷售量排行*/sort_out_num() struct goods_type *p,*qMAX; int i,j,k; clrscr(); printf(n 銷售量排行 n); printf(-n); printf(n 排名 商品號(hào) 商品名稱 商品類別 銷售量 n); p=goods; for(i=0;isum;i+) qi=p+; for(i=0;isum;i+) k=i; for(j=i+1;jout_numout_num) k=j; if(k!=i)