C语言实现:运动会多校成绩统计与查询系统代码详解
为了满足上述需求,我们需要设计一个C语言程序,包含数据结构定义、输入输出功能以及排序和查询功能。下面是一个实现这些功能的基本框架。 ```c #include <stdio.h> #include <string.h> #define MAX_SCHOOL 20 #define MAX_PROJECT 20 #define NAME_LEN 30 typedef struct { char name[NAME_LEN]; int id; int totalScore; } School; typedef struct { int schoolId; int score; } Score; typedef struct { int projectId; int topCount; // 取前几名 Score winners[5]; // 前五名 } Project; School schools[MAX_SCHOOL]; Project projects[MAX_PROJECT]; void inputSchools(int n) { for (int i = 0; i < n; ++i) { printf("请输入第 %d 所学校的名称和编号:", i + 1); scanf("%s %d", schools[i].name, &schools[i].id); schools[i].totalScore = 0; } } void inputProjects(int m, int w) { int count = 0; for (int i = 0; i < m; ++i) { printf("请输入第 %d 个男子项目的取前几名(3 或 5)及前几名的学校ID和分数:", i + 1); scanf("%d", &projects[count].topCount); for (int j = 0; j < projects[count].topCount; ++j) { scanf("%d %d", &projects[count].winners[j].schoolId, &projects[count].winners[j].score); } projects[count].projectId = i + 1; count++; } for (int i = 0; i < w; ++i) { printf("请输入第 %d 个女子项目的取前几名(3 或 5)及前几名的学校ID和分数:", i + 1); scanf("%d", &projects[count].topCount); for (int j = 0; j < projects[count].topCount; ++j) { scanf("%d %d", &projects[count].winners[j].schoolId, &projects[count].winners[j].score); } projects[count].projectId = m + i + 1; count++; } } void calculateScores() { for (int i = 0; i < MAX_PROJECT; ++i) { for (int j = 0; j < projects[i].topCount; ++j) { int schoolIndex = -1; for (int k = 0; k < MAX_SCHOOL; ++k) { if (schools[k].id == projects[i].winners[j].schoolId) { schoolIndex = k; break; } } if (schoolIndex != -1) { schools[schoolIndex].totalScore += projects[i].winners[j].score; } } } } void sortSchools(int n, int sortBy) { for (int i = 0; i < n - 1; ++i) { for (int j = 0; j < n - i - 1; ++j) { if ((sortBy == 1 && schools[j].id > schools[j + 1].id) || (sortBy == 2 && strcmp(schools[j].name, schools[j + 1].name) > 0) || (sortBy == 3 && schools[j].totalScore < schools[j + 1].totalScore)) { School temp = schools[j]; schools[j] = schools[j + 1]; schools[j + 1] = temp; } } } } void querySchool(int schoolId, int projectId) { int found = 0; for (int i = 0; i < MAX_SCHOOL; ++i) { if (schools[i].id == schoolId) { printf("学校:%s 编号:%d 总分:%d\n", schools[i].name, schools[i].id, schools[i].totalScore); found = 1; break; } } if (!found) { printf("未找到指定学校。\n"); return; } for (int i = 0; i < MAX_PROJECT; ++i) { if (projects[i].projectId == projectId) { for (int j = 0; j < projects[i].topCount; ++j) { if (projects[i].winners[j].schoolId == schoolId) { printf("在项目 %d 中获得第 %d 名,分数为 %d。\n", projectId, j + 1, projects[i].winners[j].score); } } break; } } } void queryProject(int projectId) { for (int i = 0; i < MAX_PROJECT; ++i) { if (projects[i].projectId == projectId) { printf("项目 %d 的前%d名学校如下:\n", projectId, projects[i].topCount); for (int j = 0; j < projects[i].topCount; ++j) { printf("%d. 学校:%d 分数:%d\n", j + 1, projects[i].winners[j].schoolId, projects[i].winners[j].score); } break; } } } int main() { int n, m, w; printf("请输入学校数量:"); scanf("%d", &n); inputSchools(n); printf("请输入男子项目数量和女子项目数量:"); scanf("%d %d", &m, &w); inputProjects(m, w); calculateScores(); while (1) { printf("\n请选择操作:\n1. 按学校编号排序并输出\n2. 按学校名称排序并输出\n3. 按学校总分排序并输出\n4. 查询学校项目情况\n5. 查询项目获奖情况\n6. 退出\n"); int choice; scanf("%d", &choice); switch (choice) { case 1: sortSchools(n, 1); for (int i = 0; i < n; ++i) { printf("学校:%s 编号:%d 总分:%d\n", schools[i].name, schools[i].id, schools[i].totalScore); } break; case 2: sortSchools(n, 2); for (int i = 0; i < n; ++i) { printf("学校:%s 编号:%d 总分:%d\n", schools[i].name, schools[i].id, schools[i].totalScore); } break; case 3: sortSchools(n, 3); for (int i = 0; i < n; ++i) { printf("学校:%s 编号:%d 总分:%d\n", schools[i].name, schools[i].id, schools[i].totalScore); } break; case 4: int schoolId, projectId; printf("请输入要查询的学校编号和项目编号:"); scanf("%d %d", &schoolId, &projectId); querySchool(schoolId, projectId); break; case 5: printf("请输入要查询的项目编号:"); scanf("%d", &projectId); queryProject(projectId); break; case 6: return 0; default: printf("无效的选择,请重新输入!\n"); break; } } return 0; } ``` 这个程序包含了以下几个部分: - 定义了`School` 和 `Project` 结构体来存储学校信息和项目信息。 - 提供了输入学校信息和项目信息的功能。 - 计算每个学校的总分。 - 实现了按学校编号、名称或总分排序的功能。 - 支持按学校编号查询学校在某项目中的表现。 - 支持按项目编号查询该项目的获奖情况。 ######[AI写代码神器 | 1760点数解答 | 2024-09-06 23:41:36]
- C 语言:快速实现 5 个学生信息录入、按成绩升序排序并输出!(字节豆包 | 373点数解答 | 2024-10-30 00:37:20)426
- C语言实现:输入5名学生信息并按成绩升序排序输出(字节豆包 | 354点数解答 | 2024-10-30 18:45:58)371
- C语言:输入5个学生信息,按成绩升序排序并输出(字节豆包 | 373点数解答 | 2024-10-31 19:49:58)366
- C语言:输入5名学生信息并按成绩升序排序输出(字节豆包 | 326点数解答 | 2025-01-01 20:11:47)363
- 成绩等级统计:20个60 - 100分成绩的等级数量揭秘(字节豆包 | 219点数解答 | 2025-04-09 10:20:32)237
- 培训机构学员成绩与年龄更新:C++ 代码实现(DeepSeek | 186点数解答 | 2025-12-16 18:04:31)79
- Python 处理培训机构学员培训后年龄与 NOIP 成绩提升情况(DeepSeek | 73点数解答 | 2025-12-16 18:05:20)83
- 培训机构学员成绩提升:C++代码实现年龄与NOIP成绩更新(DeepSeek | 178点数解答 | 2025-12-31 12:20:24)75
- Python 实现球类:精准计算半径、表面积与体积,附输入验证与异常处理!(阿里通义 | 261点数解答 | 2024-11-28 21:19:39)371
- 深度揭秘 Oracle Workarea Size Policy:参数调优助力数据库性能飞升(阿里通义 | 372点数解答 | 2024-05-13 10:54:45)252
- 阳光赛场激情燃,运动会开启拼搏盛宴!(字节豆包 | 264点数解答 | 2025-08-28 14:21:18)85
- C++ 实现学生成绩统计:最高分、最低分、不及格与优秀人数计算(字节豆包 | 489点数解答 | 2026-04-12 10:09:58)11