收藏 分销(赏)

VC综合实验图书馆管理系统.doc

上传人:快乐****生活 文档编号:3611043 上传时间:2024-07-10 格式:DOC 页数:35 大小:53.04KB
下载 相关 举报
VC综合实验图书馆管理系统.doc_第1页
第1页 / 共35页
VC综合实验图书馆管理系统.doc_第2页
第2页 / 共35页
VC综合实验图书馆管理系统.doc_第3页
第3页 / 共35页
VC综合实验图书馆管理系统.doc_第4页
第4页 / 共35页
VC综合实验图书馆管理系统.doc_第5页
第5页 / 共35页
点击查看更多>>
资源描述

1、VC+综合试验 图书馆管理系统.txt都是一种山旳狐狸,你跟我讲什么聊斋,站在离你近来旳地方,眺望你对他人旳微笑,虽然心是百般旳疼痛只为把你旳一举一动尽收眼底耀眼旳白色,让我明白什么是纯粹旳伤害。#include#include#include#define LENGTH 20#define SUBJECT 10char subcallSUBJECTLENGTH;int num_of_stu=0;int num_of_sub=0;struct datachar nameLENGTH;char numLENGTH;float scoreSUBJECT;float sum;float aver;s

2、truct data *next;void Menu(void);struct data *Append(struct data*);void Check(struct data*);void Modify(struct data*);void List(struct data*);void Search(struct data*);struct data *Delete(struct data*);struct data *Sort1(struct data*,int (*g)(float,float);void Sort2(struct data*,int (*g)(float,float

3、);int descend(float,float);int ascend(float,float);void main()Menu();void Menu(void)char *choice9=1.Append record,2.Check record,3.Modify record,4.List record,5.Search record,6.Delete record,7.Sort score in descending order,8.Sort score in ascending order,0.exit;struct data *head=NULL;char reply,c;i

4、nt n=0,k,i;for(i=0;ik)?n:k;while(1)system(cls);printf(ttWelcome to the Students Score Management Systemn); printf(ttt-n); for(i=0;i0;k+) putchar( ); printf(|n);printf(ttt-n);while(1)printf(Please input your choice:); reply=getchar(); if(reply=n)continue;elsec=getchar();if(reply=0&reply1&head=NULL)pr

5、intf(There is no data stored!n);else switch(reply) case1:head=Append(head);break; case2:Check(head);break; case3:Modify(head);break; case4:List(head);break; case5:Search(head);break; case6:head=Delete(head);break; case7:Sort2(head,descend);break; case8:Sort2(head,ascend);break; default:while(1) prin

6、tf(Do you really want to exit(Y/N or y/n)?); reply=getchar();if(reply=n)continue;elsec=getchar();if(reply=Y|reply=N|reply=y|reply=n)&c=n)break;else if(c!=n)while(c=getchar()!=n);if(reply=Y|reply=y)free(head);return;while(1) printf(Press ENTER to continue:);scanf(%c,&reply);if(reply=n)break;elsewhile

7、(c=getchar()!=n);struct data *Append(struct data *head)struct data *p;char reply,c;int i;system(cls);if(head=NULL)p=head=(struct data*)malloc(sizeof(struct data);printf(How many subjects do you want to record(n=%d)?,SUBJECT);scanf(%d%*c,&num_of_sub);for(i=0;inext!=NULL;p=p-next);p-next=(struct data*

8、)malloc(sizeof(struct data);p=p-next; loop:printf(Please input the students name:);scanf(%s%*c,p-name);printf(Please input the students number:);scanf(%s%*c,p-num);p-sum=0;for(i=0;iscorei);p-sum+=p-scorei;p-aver=p-sum/num_of_sub;num_of_stu+;while(1) printf(Do you want to go on appending(Y/N or y/n)?

9、); reply=getchar();if(reply=n)continue;elsec=getchar();if(reply=Y|reply=N|reply=y|reply=n)&c=n)break;else if(c!=n)while(c=getchar()!=n);if(reply=Y|reply=y)p-next=(struct data*)malloc(sizeof(struct data);p=p-next;goto loop;elsep-next=NULL;return head;void Check(struct data *head)struct data *p,*q;str

10、uct data *t=(struct data*)malloc(num_of_stu/2*sizeof(struct data*);int minlim,maxlim,n=0,i;system(cls);for(p=head;p!=NULL;p=p-next)for(i=0;iname,(*(t+i)-name)=0)break;if(inext;q!=NULL;q=q-next)if(strcmp(p-name,q-name)=0)printf(Name %s has been inputed repeatedly!n,p-name);*(t+n)=p;n+;break;printf(Al

11、together %d name has been repeatedly inputed.n,n);n=0;for(p=head;p!=NULL;p=p-next)for(i=0;inum,(*(t+i)-num)=0)break;if(inext;q!=NULL;q=q-next)if(strcmp(p-num,q-num)=0)printf(Students number %s has been inputed repeatedly!n,p-num);*(t+n)=p;n+;break;printf(Altogether %d number has been repeatedly inpu

12、ted.n,n);free(t);n=0;printf(Now check datan);printf(Please input the minimum limit:);scanf(%d%*c,&minlim);printf(Please input the maximum limit:);scanf(%d%*c,&maxlim);if(maxlimnext)for(i=0;iscoreiscoreimaxlim)if(!n)printf(These data has been wrongly inputed:n);printf(%ss %s score.n,p-name,subcalli);

13、n+;printf(Altogether %d wrong data.n,n);void Modify(struct data *head)struct data *p;char modnameLENGTH,modscoreLENGTH;char reply,c;int i;system(cls);do printf(Please input the name of the student whose data you want to modify:); scanf(%s%*c,modname); for(p=head;p!=NULL&strcmp(p-name,modname)!=0;p=p

14、-next); if(p=NULL) printf(The student doesnt exist!n); elseprintf(Successfully found!n);while(1) printf(Do you want to modify the students number(Y/N or y/n)?); reply=getchar(); if(reply=n) continue; else c=getchar(); if(reply=Y|reply=N|reply=y|reply=n)&c=n) break; else if(c!=n) while(c=getchar()!=n

15、);if(reply=Y|reply=y)printf(Please input the students new number:);scanf(%s%*c,p-num);while(1) printf(Do you want to modify the students score(Y/N or y/n)?); reply=getchar(); if(reply=n) continue; else c=getchar(); if(reply=Y|reply=N|reply=y|reply=n)&c=n) break; else if(c!=n) while(c=getchar()!=n);i

16、f(reply=Y|reply=y) do printf(Please input the name of the subject whose score you want to modify:); scanf(%s%*c,modscore); for(i=0;isum-=p-scorei; printf(Please input %ss new %s score:,p-name,modscore); scanf(%f%*c,&p-scorei);p-sum+=p-scorei; break; if(i=num_of_sub) printf(The subject doesnt exist!n

17、); while(1) printf(Do you want to go on modifying the students other scores of subject(Y/N or y/n)?); reply=getchar(); if(reply=n) continue; else c=getchar(); if(reply=Y|reply=N|reply=y|reply=n)&c=n) break; else if(c!=n) while(c=getchar()!=n); while(reply=Y|reply=y);p-aver=p-sum/num_of_sub; while(1)

18、 printf(Do you want to go on modifying other students data(Y/N or y/n)?); reply=getchar(); if(reply=n) continue; else c=getchar(); if(reply=Y|reply=N|reply=y|reply=n)&c=n) break; else if(c!=n) while(c=getchar()!=n);while(reply=Y|reply=y);void List(struct data *head)struct data *p;int n1=0,n2=0,k,i;s

19、ystem(cls);printf(name );for(p=head;p!=NULL;p=p-next)k=strlen(p-name);n1=(n1k)?n1:k;n1=(n14)?n1:4;for(i=0;inext)k=strlen(p-num);n2=(n2k)?n2:k;n2=(n26)?n2:6;for(i=0;in2-6;i+)putchar( );for(i=0;i0) printf(sum aver);putchar(n);for(p=head;p!=NULL;p=p-next)printf(%s ,p-name);k=strlen(p-name);for(i=0;inum

20、);k=strlen(p-num);for(i=0;in2-k;i+)putchar( );for(i=0;iscorei);k=strlen(subcalli);for(;k-40;k-)putchar( );if(num_of_sub0) printf(%.2f %.2f,p-sum,p-aver);putchar(n);printf(Altogether %d records.n,num_of_stu);void Search(struct data *head)struct data *p;char findnameLENGTH=0;char findnumLENGTH=0;char

21、reply,c;int flag,n1,n2,k,i;system(cls);do printf(Do you want to search the student by name(enter 1) or by number(enter 2)?); scanf(%d%*c,&flag);while(flag!=1&flag!=2);doif(flag=1) printf(Please input the name of the student you are finding:); scanf(%s%*c,findname);elseprintf(Please input the number

22、of the student you are finding:);scanf(%s%*c,findnum); for(p=head;p!=NULL;p=p-next)if(strcmp(p-name,findname)=0|strcmp(p-num,findnum)=0) printf(successfully found:nname );n1=strlen(p-name);n1=(n14)?n1:4; for(i=0;inum);n2=(n26)?n2:6;for(i=0;in2-6;i+)putchar( ); for(i=0;i0) printf(sum aver); putchar(n

23、); printf(%s ,p-name);k=strlen(p-name);for(i=0;inum);k=strlen(p-num);for(i=0;in2-k;i+)putchar( ); for(i=0;iscorei);k=strlen(subcalli); for(;k-40;k-) putchar( ); if(num_of_sub0) printf(%.2f %.2f,p-sum,p-aver); putchar(n); break;if(p=NULL) printf(The student doesnt exist!n); while(1) printf(Do you wan

24、t to go on searching(Y/N or y/n)?); reply=getchar(); if(reply=n) continue; else c=getchar(); if(reply=Y|reply=N|reply=y|reply=n)&c=n) break; else if(c!=n) while(c=getchar()!=n);while(reply=Y|reply=y);struct data *Delete(struct data *head)struct data *p,*q;char delnameLENGTH=0;char delnumLENGTH=0;cha

25、r reply,c;int flag;system(cls);do printf(Do you want to delete all the data(enter 1) or just one students data(enter 2)?); scanf(%d%*c,&flag);while(flag!=1&flag!=2);if(flag=1)num_of_stu=0;free(head);printf(Successfully deleted!n);return NULL;elsedo printf(Do you want to delete the data by name(enter

26、 1) or by number(enter 2)?); scanf(%d%*c,&flag); while(flag!=1&flag!=2);doif(flag=1) printf(Please input the name of the student whose data you want to delete:); scanf(%s%*c,delname);elseprintf(Please input the number of the student whose data you want to delete:);scanf(%s%*c,delnum);for(p=head;p!=N

27、ULL;q=p,p=p-next)if(strcmp(p-name,delname)=0|strcmp(p-num,delnum)=0)if(p=head)head=p-next;elseq-next=p-next;num_of_stu-;free(p);printf(Successfully deleted!n);break;if(p=NULL) printf(The student doesnt exist!n);if(num_of_stu=0)reply=N;else while(1) printf(Do you want to go on deleting(Y/N or y/n)?);

28、 reply=getchar(); if(reply=n) continue; else c=getchar(); if(reply=Y|reply=N|reply=y|reply=n)&c=n) break; else if(c!=n) while(c=getchar()!=n);while(reply=Y|reply=y);return head;struct data *Sort1(struct data *head,int (*g)(float,float)struct data *p,*q,*t,*pf=NULL,*qf=NULL,*tf=NULL,*temp;system(cls)

29、;for(p=head;p!=NULL;pf=t,p=t-next)t=p;for(q=p-next;q!=NULL;qf=q,q=q-next) if(*g)(q-sum,t-sum)t=q;tf=qf;if(t!=p)if(p=head)head=t;elsepf-next=t;if(t=p-next)p-next=t-next;t-next=p;elsetemp=p-next;p-next=t-next;t-next=temp;tf-next=p;List(head);return head;void Sort2(struct data *head,int (*g)(float,floa

30、t)struct data *queue=(struct data*)malloc(num_of_stu*sizeof(struct data*);struct data *p,*t;int n1=0,n2=0,k,i,j;system(cls);if(queue=NULL)printf(No enough memory!n);return;while(n1next)for(i=0;inext;p!=NULL;p=p-next) for(i=0;in1;i+) if(p=queuei) break; if(isum,t-sum) t=p; queuen1=t; n1+;n1=0;printf(name );for(i=0;iname);n1=(n1

展开阅读全文
部分上传会员的收益排行 01、路***(¥15400+),02、曲****(¥15300+),
03、wei****016(¥13200+),04、大***流(¥12600+),
05、Fis****915(¥4200+),06、h****i(¥4100+),
07、Q**(¥3400+),08、自******点(¥2400+),
09、h*****x(¥1400+),10、c****e(¥1100+),
11、be*****ha(¥800+),12、13********8(¥800+)。
相似文档                                   自信AI助手自信AI助手
搜索标签

当前位置:首页 > 包罗万象 > 大杂烩

移动网页_全站_页脚广告1

关于我们      便捷服务       自信AI       AI导航        获赠5币

©2010-2024 宁波自信网络信息技术有限公司  版权所有

客服电话:4008-655-100  投诉/维权电话:4009-655-100

gongan.png浙公网安备33021202000488号   

icp.png浙ICP备2021020529号-1  |  浙B2-20240490  

关注我们 :gzh.png    weibo.png    LOFTER.png 

客服