fork download
  1. #include <stdio.h>
  2. #include <string.h>
  3.  
  4. //学生结构体
  5. typedef struct {
  6. char id[20]; //学号
  7. char name[50]; //姓名
  8. float score; //成绩
  9. } Student;
  10.  
  11. #define MAX_STU 100 //最大100个学生
  12.  
  13. /**
  14.  * @brief 添加单个学生信息,追加到末尾
  15.  */
  16. void addStudent(Student *students, int *count)
  17. {
  18. if (*count >= MAX_STU)
  19. {
  20. printf("学生数量已达上限!\n");
  21. return;
  22. }
  23. printf("====添加1个学生信息(追加到末尾)====\n");
  24. printf("请输入学号 姓名 成绩(空格隔开):");
  25. scanf("%s %s %f", students[*count].id, students[*count].name, &students[*count].score);
  26. (*count)++;
  27. printf("添加成功!\n\n");
  28. }
  29.  
  30. /**
  31.  * @brief 批量录入多个学生
  32.  */
  33. void batchAddStudent(Student *students, int *count)
  34. {
  35. int n;
  36. printf("====批量录入学生====\n");
  37. printf("请输入本次要录入多少个学生:");
  38. scanf("%d", &n);
  39.  
  40. if(*count + n > MAX_STU)
  41. {
  42. printf("剩余空间不足,无法录入这么多!\n\n");
  43. return;
  44. }
  45.  
  46. for(int i = 0; i < n; i++)
  47. {
  48. printf("请输入第%d个学生:学号 姓名 成绩:", i+1);
  49. scanf("%s %s %f", students[*count].id, students[*count].name, &students[*count].score);
  50. (*count)++;
  51. }
  52. printf("批量录入完成!\n\n");
  53. }
  54.  
  55. /**
  56.  * @brief 在指定下标位置插入学生
  57.  */
  58. void insertStudent(Student *students, int *count)
  59. {
  60. int pos;
  61. if (*count >= MAX_STU)
  62. {
  63. printf("数组已满,无法插入!\n\n");
  64. return;
  65. }
  66. printf("====插入学生(位置从0开始)====\n");
  67. printf("请输入插入位置:");
  68. scanf("%d",&pos);
  69. if(pos < 0 || pos > *count)
  70. {
  71. printf("插入位置非法!\n\n");
  72. return;
  73. }
  74. // 后移元素,腾出pos位置
  75. for(int i = *count; i > pos; i--)
  76. {
  77. students[i] = students[i-1];
  78. }
  79. printf("输入学号 姓名 成绩:");
  80. scanf("%s %s %f", students[pos].id, students[pos].name, &students[pos].score);
  81. (*count)++;
  82. printf("插入成功!\n\n");
  83. }
  84.  
  85. /**
  86.  * @brief 按学号删除学生
  87.  */
  88. void deleteStudentById(Student *students, int *count)
  89. {
  90. char delId[20];
  91. int i, flag = 0;
  92. printf("====按学号删除学生====\n");
  93. printf("输入待删除学生学号:");
  94. scanf("%s", delId);
  95.  
  96. for(i = 0; i < *count; i++)
  97. {
  98. if(strcmp(students[i].id, delId) == 0)
  99. {
  100. flag = 1;
  101. //后面元素向前覆盖
  102. for(int j = i; j < *count -1; j++)
  103. {
  104. students[j] = students[j+1];
  105. }
  106. (*count)--;
  107. break;
  108. }
  109. }
  110. if(flag == 1)
  111. printf("删除成功!\n\n");
  112. else
  113. printf("没有找到该学号学生,删除失败!\n\n");
  114. }
  115.  
  116. /**
  117.  * @brief 根据学号查询学生
  118.  */
  119. void searchStudent(Student *students, int count)
  120. {
  121. char targetId[20];
  122. printf("====查询学生信息====\n");
  123. printf("输入要查询的学号:");
  124. scanf("%s", targetId);
  125.  
  126. for (int i = 0; i < count; i++)
  127. {
  128. if (strcmp(students[i].id, targetId) == 0)
  129. {
  130. printf("找到学生:学号:%s 姓名:%s 成绩:%.2f\n\n",
  131. students[i].id, students[i].name, students[i].score);
  132. return;
  133. }
  134. }
  135. printf("未找到该学号的学生!\n\n");
  136. }
  137.  
  138. /**
  139.  * @brief 冒泡排序:按成绩升序排序,排序完直接打印
  140.  */
  141. void sortByScore(Student *students, int count)
  142. {
  143. int i, j;
  144. Student temp;
  145. for (i = 0; i < count - 1; i++)
  146. {
  147. for (j = 0; j < count - 1 - i; j++)
  148. {
  149. if (students[j].score > students[j+1].score)
  150. {
  151. temp = students[j];
  152. students[j] = students[j+1];
  153. students[j+1] = temp;
  154. }
  155. }
  156. }
  157. printf("====按【成绩升序】排序完成,排序后结果:====\n");
  158. printf("%-12s %-12s %-8s\n","学号","姓名","成绩");
  159. for(int i=0;i<count;i++)
  160. {
  161. printf("%-12s %-12s %.2f\n",students[i].id,students[i].name,students[i].score);
  162. }
  163. printf("\n");
  164. }
  165.  
  166. /**
  167.  * @brief 冒泡排序:按学号升序排序(字符串strcmp)
  168.  */
  169. void sortById(Student *students, int count)
  170. {
  171. int i, j;
  172. Student temp;
  173. for (i = 0; i < count -1; i++)
  174. {
  175. for(j = 0; j < count-1-i; j++)
  176. {
  177. //strcmp:小于0代表前一个学号字符串更小
  178. if(strcmp(students[j].id, students[j+1].id) > 0)
  179. {
  180. temp = students[j];
  181. students[j] = students[j+1];
  182. students[j+1] = temp;
  183. }
  184. }
  185. }
  186. printf("====按【学号升序】排序完成,排序后结果:====\n");
  187. printf("%-12s %-12s %-8s\n","学号","姓名","成绩");
  188. for(int i=0;i<count;i++)
  189. {
  190. printf("%-12s %-12s %.2f\n",students[i].id,students[i].name,students[i].score);
  191. }
  192. printf("\n");
  193. }
  194.  
  195. /**
  196.  * @brief 打印全部学生信息
  197.  */
  198. void showAllStudent(Student *students, int count)
  199. {
  200. printf("====全部学生信息(共%d人)====\n", count);
  201. printf("%-12s %-12s %-8s\n","学号","姓名","成绩");
  202. for(int i=0;i<count;i++)
  203. {
  204. printf("%-12s %-12s %.2f\n",students[i].id,students[i].name,students[i].score);
  205. }
  206. printf("\n");
  207. }
  208.  
  209. //主函数菜单
  210. int main()
  211. {
  212. Student students[MAX_STU];
  213. int count = 0;
  214. int choice;
  215.  
  216. while(1)
  217. {
  218. printf("========学生成绩管理系统========\n");
  219. printf("1. 添加单个学生(末尾追加)\n");
  220. printf("2. 批量录入多个学生\n");
  221. printf("3. 指定位置【插入】学生\n");
  222. printf("4. 按学号【删除】学生\n");
  223. printf("5. 按学号查询学生\n");
  224. printf("6. 按成绩排序\n");
  225. printf("7. 按学号排序\n");
  226. printf("8. 显示全部学生\n");
  227. printf("0. 退出系统\n");
  228. printf("请输入你的功能选择:");
  229. scanf("%d",&choice);
  230. switch(choice)
  231. {
  232. case 1: addStudent(students,&count); break;
  233. case 2: batchAddStudent(students,&count); break;
  234. case 3: insertStudent(students,&count); break;
  235. case 4: deleteStudentById(students,&count); break;
  236. case 5: searchStudent(students,count); break;
  237. case 6: sortByScore(students,count); break;
  238. case 7: sortById(students,count); break;
  239. case 8: showAllStudent(students,count); break;
  240. case 0: printf("系统退出,再见!\n"); return 0;
  241. default: printf("输入选项无效,请重新选择!\n\n");
  242. }
  243. }
  244. return 0;
  245. }
Success #stdin #stdout 0s 544KB
stdin
Standard input is empty
stdout
========学生成绩管理系统========
1. 添加单个学生(末尾追加)
2. 批量录入多个学生
3. 指定位置【插入】学生
4. 按学号【删除】学生
5. 按学号查询学生
6. 按成绩排序
7. 按学号排序
8. 显示全部学生
0. 退出系统
请输入你的功能选择:系统退出,再见!