使用C语言结构体来写一个程序某班有最多不超过30人(具体人数由键盘输入)参加期末考试,考试科目最多不超过6门(具体门数由键盘输入),定义结构体类型,用结构体数组作函数参数,编程实现如下学生成绩管理: (1)录入每个学生的学号、姓名和各科考试成绩;(2)计算每门课程的总分和平均分; (3)计算每个学生的总分和平均分; (4)按每个学生的总分由高到低排出名次表;(5)按每个学生的总分由低到高排出名次表;(6)按学号由小到大排出成绩表; (7)按姓名的字典顺序排出成绩表; (8)按学号查询学生排名及其各科考试成绩;(9)按姓名查询学生排名及其各科考试成绩; (10)输出每个学生的学号、姓名、各科考试成绩、总分、平均分,以及每门课程的总分和平均分。

时间: 2023-06-17 18:08:44 浏览: 344
以下是使用C语言结构体实现学生成绩管理的程序: ```c #include <stdio.h> #include <string.h> #define MAX_STUDENTS 30 #define MAX_SUBJECTS 6 #define MAX_NAME_LENGTH 20 #define MAX_ID_LENGTH 10 struct Subject { char name[MAX_NAME_LENGTH]; int total_score; int num_students; }; struct Student { char name[MAX_NAME_LENGTH]; char id[MAX_ID_LENGTH]; int scores[MAX_SUBJECTS]; int total_score; float avg_score; }; void input_students(struct Student students[], int num_students, int num_subjects) { printf("Enter student information:\n"); for (int i = 0; i < num_students; i++) { printf("Student %d:\n", i+1); printf("Name: "); scanf("%s", students[i].name); printf("ID: "); scanf("%s", students[i].id); for (int j = 0; j < num_subjects; j++) { printf("Score for subject %d: ", j+1); scanf("%d", &students[i].scores[j]); students[i].total_score += students[i].scores[j]; } students[i].avg_score = (float)students[i].total_score / num_subjects; } } void calculate_subject_totals(struct Subject subjects[], struct Student students[], int num_students, int num_subjects) { for (int j = 0; j < num_subjects; j++) { strcpy(subjects[j].name, ""); subjects[j].total_score = 0; subjects[j].num_students = 0; for (int i = 0; i < num_students; i++) { subjects[j].total_score += students[i].scores[j]; subjects[j].num_students++; } strcpy(subjects[j].name, "Subject "); char num[2]; sprintf(num, "%d", j+1); strcat(subjects[j].name, num); } } void calculate_student_totals(struct Student students[], int num_students, int num_subjects) { for (int i = 0; i < num_students; i++) { students[i].total_score = 0; for (int j = 0; j < num_subjects; j++) { students[i].total_score += students[i].scores[j]; } students[i].avg_score = (float)students[i].total_score / num_subjects; } } void sort_students_by_total_score_desc(struct Student students[], int num_students) { for (int i = 0; i < num_students-1; i++) { for (int j = i+1; j < num_students; j++) { if (students[i].total_score < students[j].total_score) { struct Student temp = students[i]; students[i] = students[j]; students[j] = temp; } } } } void sort_students_by_total_score_asc(struct Student students[], int num_students) { for (int i = 0; i < num_students-1; i++) { for (int j = i+1; j < num_students; j++) { if (students[i].total_score > students[j].total_score) { struct Student temp = students[i]; students[i] = students[j]; students[j] = temp; } } } } void sort_students_by_id(struct Student students[], int num_students) { for (int i = 0; i < num_students-1; i++) { for (int j = i+1; j < num_students; j++) { if (strcmp(students[i].id, students[j].id) > 0) { struct Student temp = students[i]; students[i] = students[j]; students[j] = temp; } } } } void sort_students_by_name(struct Student students[], int num_students) { for (int i = 0; i < num_students-1; i++) { for (int j = i+1; j < num_students; j++) { if (strcmp(students[i].name, students[j].name) > 0) { struct Student temp = students[i]; students[i] = students[j]; students[j] = temp; } } } } void print_student_ranking(struct Student students[], int num_students) { printf("Ranking by total score (descending):\n"); printf("%-10s%-20s%-10s%-10s%-10s%-10s%-10s%-10s\n", "Rank", "Name", "ID", "Subject1", "Subject2", "Subject3", "Subject4", "Total"); int rank = 1; for (int i = 0; i < num_students; i++) { if (i == 0 || students[i].total_score < students[i-1].total_score) { rank = i+1; } printf("%-10d%-20s%-10s", rank, students[i].name, students[i].id); for (int j = 0; j < MAX_SUBJECTS; j++) { printf("%-10d", students[i].scores[j]); } printf("%-10d%-10.2f\n", students[i].total_score, students[i].avg_score); } } void print_student_scores(struct Student students[], int num_students) { printf("Student scores:\n"); printf("%-20s%-10s%-10s%-10s%-10s%-10s%-10s%-10s\n", "Name", "ID", "Subject1", "Subject2", "Subject3", "Subject4", "Total", "Average"); for (int i = 0; i < num_students; i++) { printf("%-20s%-10s", students[i].name, students[i].id); for (int j = 0; j < MAX_SUBJECTS; j++) { printf("%-10d", students[i].scores[j]); } printf("%-10d%-10.2f\n", students[i].total_score, students[i].avg_score); } } void print_subject_scores(struct Subject subjects[], int num_subjects) { printf("Subject scores:\n"); printf("%-20s%-10s%-10s\n", "Name", "Total", "Average"); for (int j = 0; j < num_subjects; j++) { printf("%-20s%-10d%-10.2f\n", subjects[j].name, subjects[j].total_score, (float)subjects[j].total_score / subjects[j].num_students); } } void print_student_by_id(struct Student students[], int num_students, char id[]) { int rank = 0; for (int i = 0; i < num_students; i++) { if (strcmp(students[i].id, id) == 0) { rank = i+1; printf("Ranking for student %s:\n", id); printf("Rank: %d\n", rank); printf("Scores:\n"); printf("%-10s%-10s%-10s%-10s%-10s%-10s%-10s%-10s\n", "Name", "ID", "Subject1", "Subject2", "Subject3", "Subject4", "Total", "Average"); printf("%-10s%-10s", students[i].name, students[i].id); for (int j = 0; j < MAX_SUBJECTS; j++) { printf("%-10d", students[i].scores[j]); } printf("%-10d%-10.2f\n", students[i].total_score, students[i].avg_score); return; } } if (rank == 0) { printf("No student with ID %s found.\n", id); } } void print_student_by_name(struct Student students[], int num_students, char name[]) { int rank = 0; for (int i = 0; i < num_students; i++) { if (strcmp(students[i].name, name) == 0) { rank = i+1; printf("Ranking for student %s:\n", name); printf("Rank: %d\n", rank); printf("Scores:\n"); printf("%-10s%-10s%-10s%-10s%-10s%-10s%-10s%-10s\n", "Name", "ID", "Subject1", "Subject2", "Subject3", "Subject4", "Total", "Average"); printf("%-10s%-10s", students[i].name, students[i].id); for (int j = 0; j < MAX_SUBJECTS; j++) { printf("%-10d", students[i].scores[j]); } printf("%-10d%-10.2f\n", students[i].total_score, students[i].avg_score); return; } } if (rank == 0) { printf("No student with name %s found.\n", name); } } int main() { int num_students, num_subjects; struct Student students[MAX_STUDENTS]; struct Subject subjects[MAX_SUBJECTS]; printf("Enter number of students (max %d): ", MAX_STUDENTS); scanf("%d", &num_students); printf("Enter number of subjects (max %d): ", MAX_SUBJECTS); scanf("%d", &num_subjects); input_students(students, num_students, num_subjects); calculate_subject_totals(subjects, students, num_students, num_subjects); calculate_student_totals(students, num_students, num_subjects); sort_students_by_total_score_desc(students, num_students); print_student_ranking(students, num_students); sort_students_by_total_score_asc(students, num_students); print_student_ranking(students, num_students); sort_students_by_id(students, num_students); print_student_scores(students, num_students); sort_students_by_name(students, num_students); print_student_scores(students, num_students); print_subject_scores(subjects, num_subjects); char id[MAX_ID_LENGTH]; printf("Enter student ID to search: "); scanf("%s", id); print_student_by_id(students, num_students, id); char name[MAX_NAME_LENGTH]; printf("Enter student name to search: "); scanf("%s", name); print_student_by_name(students, num_students, name); return 0; } ``` 以上程序实现了以下功能: - 输入学生信息 - 计算每门课程的总分和平均分 - 计算每个学生的总分和平均分 - 将学生按总分从高到低排序并输出排名表 - 将学生按总分从低到高排序并输出排名表 - 将学生按学号从小到大排序并输出成绩表 - 将学生按姓名的字典顺序排序并输出成绩表 - 输出每个学生的学号、姓名、各科考试成绩、总分、平均分,以及每门课程的总分和平均分 - 按学号查询学生排名及其各科考试成绩 - 按姓名查询学生排名及其各科考试成绩。

相关推荐

最新推荐

recommend-type

C语言结构体(struct)常见使用方法(细节问题)

主要介绍了C语言结构体(struct)常见使用方法(细节问题),需要的朋友可以参考下
recommend-type

C语言 结构体和指针详解及简单示例

本文主要介绍C语言 结构体和指针,这里整理了相关资料,并附示例代码和实现结果,以便大家学习参考,希望能帮助学习C语言的朋友
recommend-type

详解C语言中结构体的自引用和相互引用

主要介绍了C语言中结构体的自引用和相互引用,详细解析了结构体中指针的指向情况,需要的朋友可以参考下
recommend-type

C语言程序设计+研究生复试+求职+面试题

汇总了计算机研究生复试有关C语言程序设计各章节简答题,使用了易于口头表达的语言进行了总结。包括C语言程序设计基本概念及各章节问题回答。可供研究生复试或相关专业岗位面试使用。如: 简述C语⾔采取了哪些措施提...
recommend-type

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

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

实现实时数据湖架构:Kafka与Hive集成

![实现实时数据湖架构:Kafka与Hive集成](https://img-blog.csdnimg.cn/img_convert/10eb2e6972b3b6086286fc64c0b3ee41.jpeg) # 1. 实时数据湖架构概述** 实时数据湖是一种现代数据管理架构,它允许企业以低延迟的方式收集、存储和处理大量数据。与传统数据仓库不同,实时数据湖不依赖于预先定义的模式,而是采用灵活的架构,可以处理各种数据类型和格式。这种架构为企业提供了以下优势: - **实时洞察:**实时数据湖允许企业访问最新的数据,从而做出更明智的决策。 - **数据民主化:**实时数据湖使各种利益相关者都可
recommend-type

解释minorization-maximization (MM) algorithm,并给出matlab代码编写的例子

Minorization-maximization (MM) algorithm是一种常用的优化算法,用于求解非凸问题或含有约束的优化问题。该算法的基本思想是通过构造一个凸下界函数来逼近原问题,然后通过求解凸下界函数的最优解来逼近原问题的最优解。具体步骤如下: 1. 初始化参数 $\theta_0$,设 $k=0$; 2. 构造一个凸下界函数 $Q(\theta|\theta_k)$,使其满足 $Q(\theta_k|\theta_k)=f(\theta_k)$; 3. 求解 $Q(\theta|\theta_k)$ 的最优值 $\theta_{k+1}=\arg\min_\theta Q(
recommend-type

JSBSim Reference Manual

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