




免费预览已结束,剩余12页可下载查看
下载本文档
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
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;struct 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);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;int 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)printf(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) printf(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(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*)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)?); 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;struct 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(Altogether %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 inputed.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);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-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);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);if(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); 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) 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;system(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);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 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 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); 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 want 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;char 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 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!=NULL;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)?); 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);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,float)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=(n1k)?n1:k;n1=(n14)?n1:4;for(i=0;in1-4;i+)putchar( );printf(number );for(i=0;inum);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(i=0;iname);k=strlen(queuei-name);for(j=0;jnum);k=strlen(queuei-num);for(j=0;jn2-k;j+)putchar( );for(j=0;jscorej);k=strlen(subcallj);for(;k-40;k-) putchar( );if(num_of_sub0)printf(%.2f %.2f,queuei-sum,queuei-aver);putchar(n);printf(Altogether %d records.n,num_of_stu);free(queue);int descend(float a,float b)if(a-b1e-6)return 1;elsereturn 0;int ascend(float a,float b)if(b-a1e-6)return 1;elsereturn 0;本课题研究的目的就是通过一系列教学活动,激发学生的学习兴趣,为学生创造和谐的“说”的氛围,为学生积淀“说”的素材,为学生创造“说”的情景和空间局党建工作总体思路是:坚持以习近平新时代中国特色社会主义思想为指导,全面学习宣传贯彻党的十九大、十九届三中全会精神force (youth teams) and County party leaders, aimed at weakening the anti-Japanese forces. Zhuang Shaozhen was removed from Office and to the underground revolution activities carried out in the country, political parties were dissolved. Zhejiang comrades and thus losing a foothold in Wujiang basis points. To make them stay, jindapeng served as captain of the young workers through activities, make the political player-wise into the youth team. Save a group of the backbone of the resistance, and gave the Communists . Commander Zhu Xi, led by Deputy Commander Wang Hesong, stationed along the junction of Jiangsu xincheng, Wuzhen. Zhu Xi troops KMT-CCP cooperation and anti-Japanese
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 2025至2030中国租户甄别服务行业发展趋势分析与未来投资战略咨询研究报告
- 2025至2030中国碳酸饮料行业市场发展现状及竞争格局与投资发展报告
- 2025至2030中国硬质食品容器行业发展趋势分析与未来投资战略咨询研究报告
- 2025至2030中国男士香水行业市场发展分析及发展前景与投资报告
- 2025至2030中国电子相册软件行业市场发展趋势及有效策略与实施路径评估报告
- 2025至2030中国生物精炼厂行业发展状况与前景规划分析报告
- 中国数字化采购行业市场全景评估及发展战略规划报告
- 2025年中国苯丙高光面漆行业市场发展前景及发展趋势与投资战略研究报告
- 中国纺织数码喷印机行业发展监测及投资战略研究报告
- 中国扎染丝巾行业市场发展前景及发展趋势与投资战略研究报告(2024-2030)
- (更新版)国家开放大学电大《计算机绘图(本)》网考形考作业试题及答案
- 扩频通信中直接扩频系统的同步技术
- 项目部内审检查表
- 春雨计划患教指南-高血压治疗与合理用药
- 学校校本课程开辟汇报材料
- GB/T 42103-2022游乐园安全风险识别与评估
- 棒球运动主题教育PPT模板
- 级本科诊断学绪论+问诊
- GB 14648-1993民用航空器飞行事故等级
- GA 1800.5-2021电力系统治安反恐防范要求第5部分:太阳能发电企业
- 脓毒症指南解读2021完整版课件
评论
0/150
提交评论