倉庫管理系統(tǒng)c語言

1、作品名稱開發(fā)者：系統(tǒng)背景:本軟件能減輕對貨物數(shù)目管理及價格盈虧等信息處理的工作量以便能快捷及時準 確的調(diào)整貨物的倉儲量達到最合理化。可以使店主不失效率的節(jié)省大量精力用于其他方面符合當今社會的商業(yè)形式而且本軟件體積小操作簡單是管理倉庫的不二選擇系統(tǒng)簡介:設計亮點：三級菜單使操作更簡便明了密碼操作能有效保證客戶信息的安全性獨特的dos命令調(diào)用使信息存儲的實體屬性為隱藏且無擴展名大大增大了安全系數(shù)數(shù)據(jù)結構為鏈表擺脫了數(shù)據(jù)數(shù)量的限制提供三種查看模式并會標出排名退出店主模式時會提示是否保存若選擇yes著進行保存操作基本功能：在員工模式下可輸入賣出貨物的名稱和數(shù)目程序自動在后臺進行一系列的操作新建數(shù)據(jù)并同

2、時對其處理修改數(shù)據(jù)插入數(shù)據(jù)刪除數(shù)據(jù)查找數(shù)據(jù)查看數(shù)據(jù)數(shù)據(jù)存檔修改密碼三、系統(tǒng)結構圖I克麓jg用輛仇亦0 抜怕呈:g舌I#define LEN sizeof(struct shop)#include<stdio.h>#include<conio.h>#include<string.h> #include<stdlib.h> struct shopchar name30;float price_in;float price_out;int num_in;int num_now;int num_sold;float win;float percent;s

3、truct shop *next;int n=0;void main(void)void auto1(struct shop *h_p);int menu1(struct shop *h_p);void print1(void);void assistant(struct shop *head);int password(void);int menu2(struct shop *h_p);void print2(void);void creat(struct shop *h_p);void rewrite(struct shop *h_p);void insert(struct shop *h

4、_p);void deleat(struct shop *h_p);void search(struct shop *h_p);void printall(struct shop *h_p);void save(struct shop *head);void password_set(void);int password_exi(struct shop *h_p);int data_exi(struct shop *h_p); void load(struct shop *h_p);void save(struct shop *head); struct shop *addbuild(stru

5、ct shop *h_p); void sort0(struct shop *h_p);int search1(struct shop *h_p,char a30); void sort1(struct shop *h_p); void sort2(struct shop *h_p); void sort3(struct shop *h_p);void print3(void);void password_create(void);struct shop *addbuild(struct shop *h_p); int a;struct shop *head,*h_p; head=NULL;h

6、_p=&head; auto1(h_p);do a=menu1(h_p);while(a!=3); system("cls");printf(”謝謝使用 A_A");getch();int menu1(struct shop *h_p)int a,b;struct shop *head; head=*h_p;print1();scanf("%d",&a); putchar('n');getchar();doswitch(a)case 1:assistant(head);break;case 2:if(passwo

7、rd()do b=menu2(h_p); while(b!=9); break;default:break;if(a!=3) system("cls");print1(); scanf("%d",&a); while(a!=3); return(a);int menu2(struct shop *h_p)int b;char a;struct shop *head; head=*h_p;print2(); scanf("%d",&b); putchar('n'); getchar();doswitch(

8、b)case 1:creat(h_p);break;case 2:rewrite(h_p);break;case 3:insert(h_p);break;case 4:deleat(h_p);break;case 5:search(h_p);break;case 6:printall(h_p);break;case 7:head=*h_p;save(head);break;case 8:password_set();break; default:break;if(b!=9) system("cls");print2(); scanf("%d",&

9、b); getchar();while(b!=9);printf("n 保存嗎 ?(y/n):");putchar('n');scanf("%c",&a);if(a='y')head=*h_p;save(head);return(b); void auto1(struct shop *h_p)if(password_exi(h_p) && data_exi(h_p) load(h_p); void print1(void) system("cls");printf("*

10、n");printf("倉庫管理系統(tǒng)n");*printf("*n");printf("n");printf("n");printf("#|n");printf("#|n");printf(" #|1.2.3.*員工模式店主模式退出菜單|#|#|#*#*n");printf("n");printf("#*#n");printf("n 請選擇 (1-3):");void assistant

11、(struct shop *head)char a50,c='y'int b;struct shop *i;i=head; while(c='y')system("cls");printf("n 請輸入賣出的商品名稱 :n");gets(a);putchar('n');printf("n 請輸入賣出的商品數(shù)量 :n"); scanf("%d",&b);putchar('n'); while(strcmp(i->name,a)!=0&

12、;&i->next!=NULL) i=i->next;if(i->next!=NULL)i->num_now-=b;i->win=(i->num_in-i->num_now)*(i->price_out-i->price_in); elseprintf("n 此商品不存在或通知店主更新數(shù)據(jù)庫 n"); printf("n 繼續(xù)嗎？ (y/n):");putchar('n');c=getchar();getchar();save(head);int password(void)F

13、ILE*fp;char a50,b50;int i;system("cls");fp=fopen("c:y_secrea","rb");fscanf(fp,"%s",&a); fclose(fp);printf(" 請輸入密碼 :n"); putchar('n');i=0;dobi=getch();printf("*");i+; while(bi-1!=13&&i<19); bi-1='0'if(strcmp(a,

14、b)=0) return(1);elsereturn(0); void print2(void) system("cls");printf("*n");printf("店主模式n");*printf("*n");printf("n"); printf("n"); printf(" n");printf("n"); printf("n"); printf("n"); printf(" n&

15、quot;);printf("#*#|1.新建2.修改|#|3.插入4.刪除|#|5.查找6.查看|#|7.保存8.改密|#|9.上一層|#菜單*#*#*n");printf(" n");printf(" 請選擇 (1-9):");void creat(struct shop *h_p)struct shop *head,*i,*j;int f=1; head=NULL;n=0;printf("n 請輸入數(shù)據(jù) 若完成 請在名稱處輸“ 0” .nn"); i=j=addbuild(&head);if(strc

16、mp(i->name,"0")=0)f=0; while(f)n+;if(n=1) head=j;f=1;printf("n 請輸入下一種貨物的數(shù)據(jù) .nn"); i=addbuild(&head);if(strcmp(i->name,"0")=0) free(i);f=0;break;j->next=i;j=i; j->next=NULL;*h_p=head; void rewrite(struct shop *h_p)char a30;struct shop *i,*j,*head;head=*h_

17、p;i=head;doprintf("n 請輸入要修改貨物的名稱 :"); putchar('n');gets(a);if(n>=1&&!search1(h_p,a)printf("n 不存在的貨物名稱！ n");getch();if(head=NULL) goto end;while(n>=1&&!search1(h_p,a);while(strcmp(a,i->name)!=0&&i->next!=NULL) i=i->next;if(strcmp(a,i-

18、>name)=0)printf("n 真的要修改嗎？ ?(y/n):");putchar('n');if(getchar()='y')getchar();j=addbuild(h_p);strcpy(i->name,j->name);i->price_in=j->price_in;i->price_out=j->price_out;i->num_in=j->num_in;i->num_now=j->num_now;i->num_sold=j->num_sold;i-

19、>win=j->win;i->percent=j->percent;free(j);printf("n 修改完成 A_Ann");end:;void insert(struct shop *h_p)struct shop *i,*j,*x,*head; head=*h_p;x=addbuild(h_p); i=j=head;while(strcmp(i->name,x->name)<0&&i->next!=NULL) j=i;i=i->next;if(strcmp(i->name,x->nam

20、e)>=0)if(i=head) head=x;elsej->next=x;x->next=i;elsei->next=x;x->next=NULL;printf("n插入完成 A_Ann.");*h_p=head;void deleat(struct shop *h_p)struct shop*i,*j,*head;char a30,b; head=*h_p; do system("cls");printf("n 請輸入你要刪除的貨物的名稱 :n"); putchar('n');gets

21、(a);if(n>=1&&!search1(h_p,a)printf("n 不存在的貨物名稱！ n"); if(head=NULL) goto end; while(n>=1&&!search1(h_p,a);printf("n 真的要刪除嗎 ?(y/n):"); putchar('n');b=getchar();getchar();if(b='y') i=head;while(strcmp(i->name,a)!=0&&i->next!=NULL)

22、j=i;i=i->next;if(strcmp(i->name,a)=0)if(i=head)head=i->next;free(i);elsej->next=i->next;n-;printf("n刪除完成 A_A.nn");*h_p=head;end:;void search(struct shop *h_p)int begin,end,mid,t;char a30;struct shop *i,*head;head=*h_p;i=head;printf("n 請輸入要查詢貨物的名稱 :");putchar('n

23、');gets(a);while(strcmp(i->name,a)!=0)&&i->next!=NULL)i=i->next;if(strcmp(i->name,a)=0)printf("n 名稱t進價t售價t進貨數(shù)目存貨數(shù)目 銷量t贏利t利率n");printf("n= =n");printf("%s%10.2f%10.2f%10d%10d%10d%9.2f%10.2f",i->name,i->price_in,i->price _out,i->num_in,

24、i->num_now,i->num_sold,i->win,i->percent);elseprintf("n 此貨物不存在 !n");getch();void printall(struct shop *h_p)int a,c;char b='y'struct shop *i;while(b='y')dosystem("cls");print3();scanf("%d",&a);while(a!=1&&a!=2&&a!=3);switch

25、(a)case 1:sort1(h_p);break;case 2:sort2(h_p);break;case 3:sort3(h_p);break;default:break;for(c=1,i=*h_p;i->next!=NULL;i=i->next,c+)printf("n名稱t進價t售價t進貨數(shù)目存貨數(shù)目 銷量t贏利t利率t排名 n");printf("n= =n");printf("%s%10.2f%10.2f%10d%10d%10d%9.2f%10.2f%8d",i->name,i->price_i

26、n,i->pr ice_out,i->num_in,i->num_now,i->num_sold,i->win,i->percent,c);if(c%8=0)getch();getchar();printf(" 按任意鍵繼續(xù)。 。 n");printf("n名稱t進價t售價t進貨數(shù)目存貨數(shù)目 銷量t贏利t利率t排名 n");printf("n= =n");printf("%s%10.2f%10.2f%10d%10d%10d%9.2f%10.2f%8d",i->name,i-

27、>price_in,i->pr ice_out,i->num_in,i->num_now,i->num_sold,i->win,i->percent,c);getch();getchar();system("cls");printf(" 查看其他排列方式？ (y/n):");scanf("%c",&b);J1U 0dAAu-MAAp-OSIlunuA'-MoullunuAA ulunurlno gudA-ru。KA-dEeuA-一<cxl.%cxl%-p%-p%-p%cx

28、l%cxlr<%s%k4£u_& 宀Jlu 0dAAu-MAAp-OSIlunuA'-MoullunuAA ulunurlno gudA-ru。KA-dEeuA-一<cxl.%cxl%-p%-p%-p%cxl%cxlr<%s%k4£u_& (lx UA'II'-nnNll.lx u'pe£.!l)04 -pe ll.!l M=+qM=o;roPIAWO=)u dore FeroPIAW。OP=)IU9SAS M=lr eroPIAW。qEe=)LU9SAS工* dolls lonbs 山J匚 (pe

29、 II* dolls lonlso>es po>Fugelplnd腿B旺u細yM儀O.II Fugelplnd 嚴三(起6L“)思囹痛<緯堰 =)tu_dM=SQ=)E9SASop(OEOMSSedMop xocxl一 q-oCXIroPLP OH5JLU 一 山J匚 ()oslpOMSSed po> 宀 M=s>卑衛(wèi) VIVUr)上 u_d M=ll+ eroPIAW。qEe=)LU9SAS Jd4oso_o4do ai=getch(); printf("*");i+; while(ai-1!=13&&i<19); ai

30、-1='0'printf("n 請確認新密碼 :n"); putchar('n');i=0; do bi=getch(); printf("*");i+; while(bi-1!=13&&i<19); bi-1='0'if(strcmp(a,b)=0&&i>2)t=1;system("attrib c:y_secrea -h"); system("del c:y_secrea"); fp=fopen("c:y_se

31、crea","wb+"); fprintf(fp,"%s",a);fclose(fp);printf("n密碼修改完成A_An");while(t=0);elsef+;if(f=3)break;while(t=0);int password_exi(struct shop *h_p)FILE *fp;if(fp=fopen("c:y_secrea","rb")!=NULL) fclose(fp);return 1;else password_create(); creat(h_p);

32、save(*h_p);return 0; int data_exi(struct shop *h_p)FILE *fp;if(fp=fopen("c:y_data","rb")!=NULL) fclose(fp);return 1;elsecreat(h_p);save(*h_p);return 0; void load(struct shop *h_p) FILE *fp;struct shop *head,*i,*j;head=NULL;j=i=(struct shop *)malloc(LEN);if(fp=fopen("c:y_data

33、","rb")!=NULL)while(!feof(fp)fscanf(fp,"%s%f,%f,%d,%d,%d,%f,%f",i->name,&i->price_in,&i->price_out,&i->n um_in,&i->num_now,&i->num_sold,&i->win,&i->percent);n+;if(n=1)head=j;if(!feof(fp)i=(struct shop*)malloc(LEN); j->ne

34、xt=i;j=i;j->next=NULL;*h_p=head;fclose(fp); struct shop *addbuild(struct shop *h_p) struct shop *i;int b,f;float c;char a30;i=(struct shop *)malloc(LEN);dof=0;printf("n 請輸入名稱 :nn"); scanf("%s",a);if(n>=1&&search1(h_p,a)printf("n 名稱重復！ n");f=1;while(f);strc

35、py(i->name,a); if(strcmp(i->name,"0")=0) return(i);printf(" 請輸入進價 :nn");scanf("%f",&c);i->price_in=c;printf(" 請輸入售價 :nn");scanf("%f",&c);i->price_out=c;printf(" 請輸入進貨數(shù)目 :nn");scanf("%d",&b);i->num_in=b;p

36、rintf(" 請輸入現(xiàn)存數(shù)目 :nn"); scanf("%d",&b); i->num_now=b;i->num_sold=i->num_in-i->num_now;i->win=(i->num_in-i->num_now)*(i->price_out-i->price_in); i->percent=(i->price_out-i->price_in)/(i->price_in); return(i);void sort0(struct shop *h_p)str

37、uct shop *i,*j,*z,*sei,*jt,*seit;int ni,nj,np,t;char sm30;if(n>=2) for(i=*h_p,ni=1;i->next!=NULL;i=i->next,ni+) strcpy(sm,i->name);np=ni;for(j=i->next,nj=ni+1;j->next!=NULL;j=j->next,nj+) if(strcmp(sm,j->name)>0)np=nj;strcpy(sm,j->name);if(j->next=NULL) if(strcmp(sm,

38、j->name)>0) np=nj;if(np!=ni)for(t=1,j=*h_p;t<np-1;j=j->next,t+);jt=j->next;i=jt;if(ni=1)seit=*h_p;z=*h_p;*h_p=j->next;j->next=z;else for(t=1,sei=*h_p;t<ni-1;sei=sei->next,t+); seit=sei->next;z=sei->next;sei->next=j->next; j->next=z; z=jt->next; jt->nex

39、t=seit->next; seit->next=z;int search1(struct shop *h_p,char a30)struct shop *i;int j; for(i=*h_p,j=1;j<n;j+,i=i->next) if(strcmp(a,i->name)=0) return 1; if(strcmp(a,i->name)=0) return 1;else return 0;void sort1(struct shop *h_p)struct shop *i,*j,*z,*sei,*jt,*seit;int ni,nj,np,t;in

40、t sm;if(n>=2) for(i=*h_p,ni=1;i->next!=NULL;i=i->next,ni+) sm=i->num_sold; np=ni; for(j=i->next,nj=ni+1;j->next!=NULL;j=j->next,nj+) if(sm<j->num_sold)np=nj; sm=j->num_sold; if(j->next=NULL) if(sm<j->num_sold) np=nj;if(np!=ni) for(t=1,j=*h_p;t<np-1;j=j->n

41、ext,t+); jt=j->next;i=jt;if(ni=1)seit=*h_p; z=*h_p; *h_p=j->next; j->next=z;else for(t=1,sei=*h_p;t<ni-1;sei=sei->next,t+);seit=sei->next; z=sei->next; sei->next=j->next; j->next=z; z=jt->next; jt->next=seit->next; seit->next=z; void sort2(struct shop *h_p)s

42、truct shop *i,*j,*z,*sei,*jt,*seit;int ni,nj,np,t;float sm; if(n>=2) for(i=*h_p,ni=1;i->next!=NULL;i=i->next,ni+) sm=i->win;np=ni;for(j=i->next,nj=ni+1;j->next!=NULL;j=j->next,nj+) if(sm<j->win)np=nj; sm=j->win; if(j->next=NULL) if(sm<j->win) np=nj;if(np!=ni) f

43、or(t=1,j=*h_p;t<np-1;j=j->next,t+); jt=j->next; i=jt;if(ni=1) seit=*h_p; z=*h_p; *h_p=j->next; j->next=z;else for(t=1,sei=*h_p;t<ni-1;sei=sei->next,t+);seit=sei->next; z=sei->next; sei->next=j->next; j->next=z; z=jt->next; jt->next=seit->next; seit->next=z; void sort3(struct shop *h_p)struct shop *i,*j,*z,*sei,*jt,*seit;int ni,nj,np,t;float sm;if(n>=2) for(i=*h_p,ni