编写C语言程序,定义一个高考成绩记录信息的结构体,包含考试号(stuNo)、姓名(name)、语文成绩(chnScore)、数学成绩(mathScore)、英语成绩(engScore)、平均成绩(avgScore), (1)通过scanf函数从终端输入十个学生信息,保存到结构体数组中: (可以允许在程序初始化的时候初始化这些信息【因为程序调试的输入成本太高,所以允许大家直接初始化这个信息】,但是scanf函数必须定义出来。 (2)计算每个学生的三门课的平均成绩,结果保存到avgscore成员变量中 (3)按照原始输入顺序打印所有学生的信息(一行打印一个学生的信息) (4)按照平均分由高到低输出学生的信息 (5)输出英语成绩最低的同学的信息;输出平均成绩最高的同学的信息 (6)输出数学分数最高的五个学生的学号、姓名和数学成绩信息; (7)输出数学分数最高且英语分数高于75分的三个学生的信息; (8)输出按照以语文成绩由高分到低分排序的学生信息,如果语文成绩相同,按 照数学成绩由高到低排序输出。 (9)再从键盘获取学号,根据学号查询是否有该学号的记录,如果有,就输出该 学号对应的学生的信息,如果没有则输出查无此人。

时间: 2023-06-12 13:03:39 浏览: 483
以下是代码实现: ```c #include <stdio.h> #include <string.h> #define MAX_STUDENT 10 struct Student { int stuNo; char name[20]; int chnScore; int mathScore; int engScore; float avgScore; }; void initStudent(struct Student *s) { s->stuNo = 0; strcpy(s->name, ""); s->chnScore = 0; s->mathScore = 0; s->engScore = 0; s->avgScore = 0.0; } void inputStudent(struct Student *s) { printf("请输入考试号:"); scanf("%d", &s->stuNo); printf("请输入姓名:"); scanf("%s", s->name); printf("请输入语文成绩:"); scanf("%d", &s->chnScore); printf("请输入数学成绩:"); scanf("%d", &s->mathScore); printf("请输入英语成绩:"); scanf("%d", &s->engScore); s->avgScore = (s->chnScore + s->mathScore + s->engScore) / 3.0; } void printStudent(struct Student s) { printf("%d\t%s\t%d\t%d\t%d\t%.2f\n", s.stuNo, s.name, s.chnScore, s.mathScore, s.engScore, s.avgScore); } void printStudents(struct Student *students, int n) { printf("所有学生信息:\n"); for (int i = 0; i < n; i++) { printStudent(students[i]); } } void sortStudentsByAvgScore(struct Student *students, int n) { for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (students[i].avgScore < students[j].avgScore) { struct Student temp = students[i]; students[i] = students[j]; students[j] = temp; } } } } void printStudentWithLowestEngScore(struct Student *students, int n) { int minEngScore = students[0].engScore; int minEngScoreIndex = 0; for (int i = 1; i < n; i++) { if (students[i].engScore < minEngScore) { minEngScore = students[i].engScore; minEngScoreIndex = i; } } printf("英语成绩最低的同学信息:\n"); printStudent(students[minEngScoreIndex]); } void printStudentWithHighestAvgScore(struct Student *students, int n) { float maxAvgScore = students[0].avgScore; int maxAvgScoreIndex = 0; for (int i = 1; i < n; i++) { if (students[i].avgScore > maxAvgScore) { maxAvgScore = students[i].avgScore; maxAvgScoreIndex = i; } } printf("平均成绩最高的同学信息:\n"); printStudent(students[maxAvgScoreIndex]); } void sortStudentsByMathScore(struct Student *students, int n) { for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (students[i].mathScore < students[j].mathScore) { struct Student temp = students[i]; students[i] = students[j]; students[j] = temp; } } } } void printTop5StudentsByMathScore(struct Student *students, int n) { sortStudentsByMathScore(students, n); printf("数学分数最高的五个学生信息:\n"); for (int i = 0; i < 5 && i < n; i++) { printf("%d\t%s\t%d\n", students[i].stuNo, students[i].name, students[i].mathScore); } } void printTop3StudentsByMathScoreAndEngScore(struct Student *students, int n) { struct Student tempStudents[MAX_STUDENT]; int tempIndex = 0; for (int i = 0; i < n; i++) { if (students[i].mathScore > tempStudents[0].mathScore) { tempStudents[0] = students[i]; for (int j = 1; j < 3; j++) { if (tempStudents[j].engScore < tempStudents[j - 1].engScore) { struct Student temp = tempStudents[j]; tempStudents[j] = tempStudents[j - 1]; tempStudents[j - 1] = temp; } } } } printf("数学分数最高且英语分数高于75分的三个学生信息:\n"); for (int i = 0; i < 3; i++) { printStudent(tempStudents[i]); } } void sortStudentsByChnScoreAndMathScore(struct Student *students, int n) { for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (students[i].chnScore < students[j].chnScore) { struct Student temp = students[i]; students[i] = students[j]; students[j] = temp; } else if (students[i].chnScore == students[j].chnScore && students[i].mathScore < students[j].mathScore) { struct Student temp = students[i]; students[i] = students[j]; students[j] = temp; } } } } void printStudentByChnScoreAndMathScore(struct Student *students, int n) { sortStudentsByChnScoreAndMathScore(students, n); printf("按照语文成绩由高到低排序的学生信息:\n"); for (int i = 0; i < n; i++) { printStudent(students[i]); } } int main() { struct Student students[MAX_STUDENT]; for (int i = 0; i < MAX_STUDENT; i++) { initStudent(&students[i]); } // 直接初始化学生信息 students[0].stuNo = 1; strcpy(students[0].name, "张三"); students[0].chnScore = 90; students[0].mathScore = 85; students[0].engScore = 80; students[0].avgScore = (students[0].chnScore + students[0].mathScore + students[0].engScore) / 3.0; students[1].stuNo = 2; strcpy(students[1].name, "李四"); students[1].chnScore = 85; students[1].mathScore = 90; students[1].engScore = 75; students[1].avgScore = (students[1].chnScore + students[1].mathScore + students[1].engScore) / 3.0; students[2].stuNo = 3; strcpy(students[2].name, "王五"); students[2].chnScore = 80; students[2].mathScore = 90; students[2].engScore = 85; students[2].avgScore = (students[2].chnScore + students[2].mathScore + students[2].engScore) / 3.0; students[3].stuNo = 4; strcpy(students[3].name, "赵六"); students[3].chnScore = 75; students[3].mathScore = 80; students[3].engScore = 90; students[3].avgScore = (students[3].chnScore + students[3].mathScore + students[3].engScore) / 3.0; students[4].stuNo = 5; strcpy(students[4].name, "小明"); students[4].chnScore = 60; students[4].mathScore = 70; students[4].engScore = 80; students[4].avgScore = (students[4].chnScore + students[4].mathScore + students[4].engScore) / 3.0; students[5].stuNo = 6; strcpy(students[5].name, "小红"); students[5].chnScore = 70; students[5].mathScore = 60; students[5].engScore = 75; students[5].avgScore = (students[5].chnScore + students[5].mathScore + students[5].engScore) / 3.0; students[6].stuNo = 7; strcpy(students[6].name, "小刚"); students[6].chnScore = 80; students[6].mathScore = 85; students[6].engScore = 90; students[6].avgScore = (students[6].chnScore + students[6].mathScore + students[6].engScore) / 3.0; students[7].stuNo = 8; strcpy(students[7].name, "小李"); students[7].chnScore = 75; students[7].mathScore = 70; students[7].engScore = 80; students[7].avgScore = (students[7].chnScore + students[7].mathScore + students[7].engScore) / 3.0; students[8].stuNo = 9; strcpy(students[8].name, "小张"); students[8].chnScore = 90; students[8].mathScore = 80; students[8].engScore = 75; students[8].avgScore = (students[8].chnScore + students[8].mathScore + students[8].engScore) / 3.0; students[9].stuNo = 10; strcpy(students[9].name, "小王"); students[9].chnScore = 85; students[9].mathScore = 90; students[9].engScore = 80; students[9].avgScore = (students[9].chnScore + students[9].mathScore + students[9].engScore) / 3.0; printStudents(students, MAX_STUDENT); sortStudentsByAvgScore(students, MAX_STUDENT); printf("按照平均分由高到低输出学生信息:\n"); printStudents(students, MAX_STUDENT); printStudentWithLowestEngScore(students, MAX_STUDENT); printStudentWithHighestAvgScore(students, MAX_STUDENT); printTop5StudentsByMathScore(students, MAX_STUDENT); printTop3StudentsByMathScoreAndEngScore(students, MAX_STUDENT); printStudentByChnScoreAndMathScore(students, MAX_STUDENT); int queryStuNo; printf("请输入要查询的学号:"); scanf("%d", &queryStuNo); int queryStuIndex = -1; for (int i = 0; i < MAX_STUDENT; i++) { if (students[i].stuNo == queryStuNo) { queryStuIndex = i; break; } } if (queryStuIndex == -1) { printf("查无此人。\n"); } else { printf("查询到的学生信息:\n"); printStudent(students[queryStuIndex]); } return 0; } ```

相关推荐

最新推荐

recommend-type

深入分析C语言中结构体指针的定义与引用详解

本篇文章是对C语言中结构体指针的定义与引用进行了详细的分析介绍,需要的朋友参考下
recommend-type

scrapy练习 获取喜欢的书籍

主要是根据网上大神做的 项目一 https://zhuanlan.zhihu.com/p/687522335
recommend-type

zigbee-cluster-library-specification

最新的zigbee-cluster-library-specification说明文档。
recommend-type

管理建模和仿真的文件

管理Boualem Benatallah引用此版本:布阿利姆·贝纳塔拉。管理建模和仿真。约瑟夫-傅立叶大学-格勒诺布尔第一大学,1996年。法语。NNT:电话:00345357HAL ID:电话:00345357https://theses.hal.science/tel-003453572008年12月9日提交HAL是一个多学科的开放存取档案馆,用于存放和传播科学研究论文,无论它们是否被公开。论文可以来自法国或国外的教学和研究机构,也可以来自公共或私人研究中心。L’archive ouverte pluridisciplinaire
recommend-type

【实战演练】MATLAB用遗传算法改进粒子群GA-PSO算法

![MATLAB智能算法合集](https://static.fuxi.netease.com/fuxi-official/web/20221101/83f465753fd49c41536a5640367d4340.jpg) # 2.1 遗传算法的原理和实现 遗传算法(GA)是一种受生物进化过程启发的优化算法。它通过模拟自然选择和遗传机制来搜索最优解。 **2.1.1 遗传算法的编码和解码** 编码是将问题空间中的解表示为二进制字符串或其他数据结构的过程。解码是将编码的解转换为问题空间中的实际解的过程。常见的编码方法包括二进制编码、实数编码和树形编码。 **2.1.2 遗传算法的交叉和
recommend-type

openstack的20种接口有哪些

以下是OpenStack的20种API接口: 1. Identity (Keystone) API 2. Compute (Nova) API 3. Networking (Neutron) API 4. Block Storage (Cinder) API 5. Object Storage (Swift) API 6. Image (Glance) API 7. Telemetry (Ceilometer) API 8. Orchestration (Heat) API 9. Database (Trove) API 10. Bare Metal (Ironic) API 11. DNS
recommend-type

JSBSim Reference Manual

JSBSim参考手册,其中包含JSBSim简介,JSBSim配置文件xml的编写语法,编程手册以及一些应用实例等。其中有部分内容还没有写完,估计有生之年很难看到完整版了,但是内容还是很有参考价值的。
recommend-type

"互动学习:行动中的多样性与论文攻读经历"

多样性她- 事实上SCI NCES你的时间表ECOLEDO C Tora SC和NCESPOUR l’Ingén学习互动,互动学习以行动为中心的强化学习学会互动,互动学习,以行动为中心的强化学习计算机科学博士论文于2021年9月28日在Villeneuve d'Asq公开支持马修·瑟林评审团主席法布里斯·勒菲弗尔阿维尼翁大学教授论文指导奥利维尔·皮耶昆谷歌研究教授:智囊团论文联合主任菲利普·普雷教授,大学。里尔/CRISTAL/因里亚报告员奥利维耶·西格德索邦大学报告员卢多维奇·德诺耶教授,Facebook /索邦大学审查员越南圣迈IMT Atlantic高级讲师邀请弗洛里安·斯特鲁布博士,Deepmind对于那些及时看到自己错误的人...3谢谢你首先,我要感谢我的两位博士生导师Olivier和Philippe。奥利维尔,"站在巨人的肩膀上"这句话对你来说完全有意义了。从科学上讲,你知道在这篇论文的(许多)错误中,你是我可以依
recommend-type

【实战演练】时间序列预测用于个体家庭功率预测_ARIMA, xgboost, RNN

![【实战演练】时间序列预测用于个体家庭功率预测_ARIMA, xgboost, RNN](https://img-blog.csdnimg.cn/img_convert/5587b4ec6abfc40c76db14fbef6280db.jpeg) # 1. 时间序列预测简介** 时间序列预测是一种预测未来值的技术,其基于历史数据中的时间依赖关系。它广泛应用于各种领域,例如经济、金融、能源和医疗保健。时间序列预测模型旨在捕捉数据中的模式和趋势,并使用这些信息来预测未来的值。 # 2. 时间序列预测方法 时间序列预测方法是利用历史数据来预测未来趋势或值的统计技术。在时间序列预测中,有许多不
recommend-type

怎么在集群安装安装hbase

您好,关于如何在集群上安装HBase,步骤大致如下: 1. 在HBase官网上下载最新版本的HBase,并解压到需要安装的目录下; 2. 配置HBase的环境变量:将HBase目录的bin子目录加入到PATH环境变量中; 3. 修改HBase配置文件:在HBase目录下的conf子目录中找到hbase-site.xml文件,并进行相应的配置,如指定HBase的Zookeeper节点等; 4. 启动HBase:使用HBase的bin目录下的start-hbase.sh脚本启动HBase; 5. 验证HBase是否正常运行:使用HBase自带的shell命令行工具操作HBase。 注意:以上步