本文共 1864 字,大约阅读时间需要 6 分钟。
Mooc????? ? ?????????
?????C????????????????????????? ????????? ??????????? ????????? ?????????????????? ????????????? qwq ???????? ??????????hhh ~~
#include#define len 10typedef struct winners { char name[20]; int finalScore; int classScore; char work; char west; int paper; int scholarship;} WIN;void Addup(WIN stu[], int n);int main() { int i; WIN stu[len]; printf("Input n:\n"); scanf("%d", &i); Addup(stu, i);}void Addup(WIN stu[], int n) { int i, sum = 0, m = 0, max = 0; for (i = 0; i <= n - 1; i++) { sum = 0; printf("Input name:\n"); scanf("%s", stu[i].name); printf("Input final score:\n"); scanf("%d", &stu[i].finalScore); printf("Input class score:\n"); scanf("%d", &stu[i].classScore); getchar(); printf("Class cadre or not?(Y/N):\n"); scanf("%c", &stu[i].work); getchar(); printf("Students from the West or not?(Y/N):\n"); scanf("%c", &stu[i].west); printf("Input the number of published papers:\n"); scanf("%d", &stu[i].paper); if (stu[i].finalScore > 80 && stu[i].paper > 0) sum += 8000; if (stu[i].finalScore > 85 && stu[i].classScore > 80) sum += 4000; if (stu[i].finalScore > 90) sum += 2000; if (stu[i].finalScore > 85 && stu[i].west == 'Y') sum += 1000; if (stu[i].finalScore > 80 && stu[i].work == 'Y') sum += 850; if (sum > max) { max = sum; m = i; } printf("name:%s,scholarship:%d\n", stu[i].name, sum); } printf("%s get the highest scholarship %d\n", stu[m].name, max);}
?????
转载地址:http://uxji.baihongyu.com/