




已阅读5页,还剩3页未读, 继续免费阅读
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
学生成绩管理系统(一)#include #include struct list int num; char name256; int china; int english; int math; struct list *next; ; typedef struct list node; typedef node *link; printf_list(link head) link pointer; pointer=head; while(pointer!=NULL) printf(number:%dn,pointer-num); printf(name:%sn,pointer-name); printf(china:%dn,pointer-china); printf(english:%dn,pointer-english); printf(math:%dn,pointer-math); pointer=pointer-next; link creat_list(link head) int cnum; char cname256; int cchina; int cenglish; int cmath; link pointer,new; int i; head=(link)malloc(sizeof(node); if(head=NULL) printf(memory allocate failure!n); exit(0); else printf(please input number:); scanf(%d,&cnum); printf(please input name:); scanf(%s,&cname); printf(please input china:); scanf(%d,&cchina); printf(please input english:); scanf(%d,&cenglish); printf(please input math:); scanf(%d,&cmath); head-num=cnum; for(i=0;inamei=cnamei; head-china=cchina; head-english=cenglish; head-math=cmath; head-next=NULL; pointer=head; while(1) new=(link)malloc(sizeof(node); if(new=NULL) printf(memory allocate failure!n); exit(0); printf(please input number:); scanf(%d,&cnum); if(cnum=0) break; printf(please input name:); scanf(%s,cname); printf(please input china:); scanf(%d,&cchina); printf(please input english:); scanf(%d,&cenglish); printf(please input math:); scanf(%d,&cmath); new-num=cnum; for(i=0;inamei=cnamei; new-china=cchina; new-english=cenglish; new-math=cmath; new-next=NULL; pointer-next=new; pointer=new; return head; search_chengji(int key1,link head) link pointer; pointer=head; while(pointer!=NULL) if(pointer-num=key1) printf(number:%dn,pointer-num); printf(name:%sn,pointer-name); printf(china:%dn,pointer-china); printf(english:%dn,pointer-english); printf(math:%dn,pointer-math); pointer=pointer-next; link modify_chengji(link head,int key3) link pointer; char xname256; int xchina; int xenglish; int xmath; int choose,i; pointer=head; printf(enter 0 exit modefiyn); printf(enter 1 modefiy namen); printf(enter 2 modefiy chinan); printf(enter 3 modefiy englishn); printf(enter 4 modefiy mathn); scanf(%d,&choose); switch(choose) case 1: printf(please input name:); scanf(%s,&xname); break; case 2: printf(please input china:); scanf(%d,&xchina); break; case 3: printf(please input english:); scanf(%d,&xenglish); break; case 4: printf(please input math:); scanf(%d,&xmath); break; while(1) pointer=pointer-next; if(pointer-num=key3) if(choose=1) for(i=0;inamei=xnamei; break; else if(choose=2) pointer-china=xchina; break; else if(choose=3) pointer-english=xenglish; break; else if(choose=4) pointer-math=xmath; break; return head; link delete_chengji(link head,int key2) link pointer; link back; pointer=head; while(1) if(head-num=key2) head=pointer-next; free(pointer); break; back=pointer; pointer=pointer-next; if(pointer-num=key2) back-next=pointer-next; free(pointer); break; return head; link insert_chengji(link head,link new,int key3) link pointer; pointer=head; while(1) if(pointer=NULL) new-next=head; head=new; break; if(pointer-num=key3) new-next=pointer-next; pointer-next=new; break; pointer=pointer-next; return head; pingjufen(link head) link pointer; int pchina,ppchina; int penglish,ppenglish; int pmath,ppmath; int count; pchina=0; penglish=0; pmath=0; count=0; pointer=head; while(1) pchina=pchina+pointer-china; penglish=penglish+pointer-english; pmath=pmath+pointer-math; count=+count; if(pointer-next=NULL) break; pointer=pointer-next; ppchina=pchina/count; ppenglish=penglish/count; ppmath=pmath/count; printf(china ping jun fen:%dn,ppchina); printf(english ping jun fen:%dn,ppenglish); printf(math ping jun fen:%dn,ppmath); main() for(;) link head; link new; int key; int keynum; printf(0exit the programm.n); printf(1create list.n); printf(2search chengji.n); printf(3modify chengji.n); printf(4delete chengji.n); printf(5add chengji.n); printf(6pingjunfeng.n); printf(7print chengji.n); scanf(%d,&key); switch(key) case 0: exit(0); case 1: head=creat_list(head); if(head!=NULL) printf_list(head); break; case 2: printf(please input 0 Exit.n); printf(please input number for search:); scanf(%d,&keynum); if(keynum=0) break; search_chengji(keynum,head); break; case 3: printf(please input number for modify:); scanf(%d,&keynum); head=modify_chengji(head,keynum); if(head!=NULL) printf_list(head); break; case 4: printf(please input 0 exitn); printf(please input number for delete:); scanf(%d,&keynum); if(keynum=0) break; head=delete_chengji(head,keynum); break; case 5: if(head!=NULL) new=(link)malloc(sizeof(node); printf(please input number:); scanf(%d,&new-num); if(new-num=0) break; printf(please input name:); scanf(%s,&new-name); printf(please input china:); scanf(%d,&new-china); printf(please input english:); scanf(%d,&new-english); printf(pleas
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 3D打印轮胎工艺-洞察与解读
- 2025年及未来5年中国花草茶行业市场调研分析及投资战略咨询报告
- 2025湖南湘潭市市直学校人才引进45人模拟试卷(含答案详解)
- 2025湖南红花园投资开发有限公司招聘10人考前自测高频考点模拟试题及答案详解(全优)
- 2025辽宁抚顺高新热电有限责任公司招聘专业技术人员18人考前自测高频考点模拟试题及参考答案详解1套
- 2025广东深圳市优才人力资源有限公司招聘聘员(派遣至深圳市龙岗区审计局)1人考前自测高频考点模拟试题及答案详解(名校卷)
- 绿电消纳策略-洞察与解读
- 2025河北保定市雄安新区雄县事业单位招聘89人考前自测高频考点模拟试题及一套答案详解
- 2025年甘肃农业大学招聘工作人员考前自测高频考点模拟试题及答案详解(易错题)
- 2025河北承德市消防救援支队招聘政府专职消防队员模拟试卷及答案详解(有一套)
- 浙教版七年级下册科学-优化训练-第二章单元测试卷
- 民办学校未来发展策划与实施方案
- 临床课题申报书范例范文
- 山体.施工合同样本
- 肺结核课件培训
- 2025年上海市大数据中心工作人员公开招聘考试参考题库及答案解析
- 锅炉工安全培训知识课件
- 2025年广东省东莞市公安辅警招聘知识考试题(含答案)
- 个体诊所管理暂行办法
- 志愿服务条例知识培训课件
- GB 46031-2025可燃粉尘工艺系统防爆技术规范
评论
0/150
提交评论