仓库管理系统(c语言)知识讲解

1、仓 库 管 理 系 统 （ c 语 言 ）作品名称开发者：一、 系统背景：本软件能减轻对货物数目管理及价格盈亏等信息处理的工作量以便能 快捷及时准确的调整货物的仓储量达到最合理化。可以使店主不失效率 的节省大量精力用于其他方面 符合当今社会的商业形式而且本软件体积 小操作简单是管理仓库的不二选择二、 系统简介：设计亮点：三级菜单使操作更简便明了密码操作能有效保证客户信息的安全性独特的dos命令调用使信息存储的实体属性为隐藏且无扩展名大大增大了安全系数数据结构为链表摆脱了数据数量的限制提供三种查看模式并会标出排名退出店主模式时会提示是否保存若选择 yes着进行保存操作基本功能：在员工模式下可输入

2、卖出货物的名称和数目程序自动在后台进行一系列的操作新建数据并同时对其处理修改数据插入数据删除数据-查找数据-查看数据-数据存档修改密码系统结构图I粽十甘甘靂撤鑼解严标屮盘可惦ft I网左可#defi ne LEN sizeof(struct shop) #i nclude<stdio.h>#in clude<c oni o.h>#i ncludevstri ng.h>#in clude<stdlib.h>struct shopchar n ame30;float pricen;float price_out;int num_in;int num_now

3、;int nu m_sold;float win;float perce nt; struct shop *n ext;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(s

4、truct shop *h_p); void insert(struct shop *h_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

5、(struct shop *head);struct shop *addbuild(struct 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

6、); int a;struct shop *head,*h_p; head=NULL;h_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(

7、a)case 1:assistant(head);break;case 2:if(password()dob=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); p

8、utchar('n'); getchar();do switch(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

9、"); print2();scanf("%d",&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(v

10、oid) system("cls");printf("f*n");printf(" 仓库管理系统n");printf("*n");f*printf("n");菜单n");printf("#|1. 员工模式printf("#|2. 店主模式printf("#|3. 退出printf("printf("|#n");|#n");|# n");n");printf(" n");prin

11、tf("n 请选择 (1-3):");void assistant(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 请输入卖出的商品数量 :n");scanf("%d",&b);putchar(

12、'n'); while(strcmp(i->name,a)!=0&&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 此商品不存在或通知店主更新数据库 n");printf("n 继续吗？ (y/n):");putchar('n');c=getc

13、har();getchar();save(head);int password(void)FILE*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&

14、&i<19);bi-1='0'if(strcmp(a,b)=0)return(1);elsereturn(0);void print2(void)system("cls");printf("*n");printf(" 店主模式n");f*printf("*n");f*printf("printf("n");printf("#|1.新建2.修改|#n");printf("#|3.插入4.删除|#n");printf(&

15、quot;#|5.查找6.查看|#n");printf("#|7.保存8.改密|#n");printf("#|9.上一层|#n");菜单n");printf("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请输入数据若完成请在名称处输“O”nn");i=j=add

16、build(&head);if(strcmp(i->name,"O")=O)f=O;while(f)n+;if(n=1)head=j;f=1;printf("n 请输入下一种货物的数据 .nn");i=addbuild(&head);if(strcmp(i->name,"O")=O)free(i);f=O;break;j->next=i;j=i;j->next=NULL;*h_p=head;void rewrite(struct shop *h_p)char a3O;struct shop *i

17、,*j,*head;head=*h_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->ne

18、xt;if(strcmp(a,i->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

19、_sold=j->num_sold; i->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(

20、strcmp(i->name,x->name)>=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"

21、;); putchar('n');gets(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&

22、amp;&i->next!=NULL) 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 请输入要查询

23、货物的名称 :");putchar('n');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进货数目存货数目销量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-

24、>price_out,i->num_in,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')do system("cls");print3();scanf("%d",&a);while(a!=1&&am

25、p;a!=2&&a!=3);switch(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进货数目存货数目销量t赢利t利率t排名 n");printf("n= =n");printf("%s%10.2f%10.2f%10d%10d%10d%9.2f%10.2f%8d&quo

26、t;,i->name,i- >price_in,i->price_out,i->num_in,i->num_now,i->num_sold,i->win,i->percent,c);if(c%8=0)getch();getchar();printf(" 按任意键继续。 n");printf("n名称t进价t售价t进货数目存货数目销量t赢利t利率t排 名 n"); printf("n= =n");printf("%s%10.2f%10.2f%10d%10d%10d%9.2f%10

27、.2f%8d",i->name,i- >price_in,i->price_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);putchar('n');void save(struct shop *head)FILE *fp;struct s

28、hop *i;system("attrib c:y_data -h");system("del c:y_data"); fp=fopen("c:y_data","wb+");i=head; for(i=head;i->next!=NULL;i=i->next) fprintf(fp,"%s%7.2f,%.2f,%d,%d,%d,%.2f,%.2f,",i->name,i->price_in,i- >price_out,i->num_in,i->num_n

29、ow,i->num_sold,i->win,i->percent); fprintf(fp,"%s%7.2f,%.2f,%d,%d,%d,%.2f,%.2f,",i->name,i->price_in,i- >price_out,i->num_in,i->num_now,i->num_sold,i->win,i->percent);fclose(fp);system("attrib c:y_data +h");printf("nA_A 已保存 n");void pass

30、word_set()FILE *fp;int i,f=0,t=0;char a20,b20;doif(password()dosystem("cls");printf("请输入新密码(319位):n");putchar('n');i=0;doai=getch();printf("*");i+;while(ai-1!=13&&i<19);ai-1='0'printf("n 请确认新密码 :n"); putchar('n');i=0;dobi=get

31、ch();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_secrea","wb+");fprintf(fp,"%s",a);fclose(fp);printf("n密码修改

32、完成A_An");while(t=0); else f+; 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); save(*h_p);return 0;int data_exi(struct shop *h_p)FILE *fp;if(fp=fopen("c:y_d

33、ata","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","rb")!=NULL)while(!feof(fp)fscanf(fp,"%s%f,%f,%d,%d,%d,%f,%

34、f",i->name,&i->price_in,&i->price_out,&i- >num_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->next=i;j=i; j->next=NULL;*h_p=head;fclose(fp);struct shop *addbuild(struct shop *

35、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);strcpy(i->name,a);if(strcmp(i->name,"0")=0) return(i);printf(" 请

36、输入进价 :nn");scanf("%f",&c);i->price_in=c;printf(" 请输入售价 :nn");scanf("%f",&c);i->price_out=c;printf(" 请输入进货数目 :nn");scanf("%d",&b);i->num_in=b;printf(" 请输入现存数目 :nn");scanf("%d",&b);i->num_now=b; i-&g

37、t;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) struct shop *i,*j,*z,*sei,*jt,*seit;int ni,nj,np,t;char sm30; if(n>=2) for(i=*h_p

38、,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,j->name)>0) np=nj;if(np!=ni) for(t=1,j=*h_p;t<np-1;j=j->next,t+);

39、 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; int search1(struct shop *h_p,char a

40、30) 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;int sm;if(n>=2) for(i=*h_p,ni=1;i->next!=NULL;i=i->next,ni+)

41、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->next,t+);jt=j->next;i=jt;if(ni=1) seit=*h_p; z=*h_p; *h_p=j->next; j

42、->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)struct shop *i,*j,*z,*sei,*jt,*seit;int ni,nj,np,t;float sm;if(n>=2) f

43、or(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) for(t=1,j=*h_p;t<np-1;j=j->next,t+); jt=j->next;i=jt; if(ni=1) seit

44、=*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;i