博客
关于我
奖学金发放
阅读量:200 次
发布时间:2019-02-28

本文共 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);}

?????

  • ??????????????AI?????
  • ???????div??
  • ?????????????
  • ????????????????????
  • ????????????
  • ??????????
  • ????????????????????????
  • ??????????
  • ????????
  • ???????????
  • 转载地址:http://uxji.baihongyu.com/

    你可能感兴趣的文章
    Objective-C实现bellman ford贝尔曼福特算法(附完整源码)
    查看>>
    Objective-C实现bellman-ford贝尔曼-福特算法(附完整源码)
    查看>>
    Objective-C实现bellman-ford贝尔曼-福特算法(附完整源码)
    查看>>
    Objective-C实现BellmanFord贝尔曼-福特算法(附完整源码)
    查看>>
    Objective-C实现bezier curve贝塞尔曲线算法(附完整源码)
    查看>>
    Objective-C实现bfs 最短路径算法(附完整源码)
    查看>>
    Objective-C实现BF算法 (附完整源码)
    查看>>
    Objective-C实现Bilateral Filter双边滤波器算法(附完整源码)
    查看>>
    Objective-C实现binary exponentiation二进制幂运算算法(附完整源码)
    查看>>
    Objective-C实现binary tree mirror二叉树镜像算法(附完整源码)
    查看>>
    Objective-C实现binary tree traversal二叉树遍历算法(附完整源码)
    查看>>
    Objective-C实现BinarySearchTreeNode树算法(附完整源码)
    查看>>
    Objective-C实现binomial coefficient二项式系数算法(附完整源码)
    查看>>
    Objective-C实现bisection二分法算法(附完整源码)
    查看>>
    Objective-C实现bisection二等分算法(附完整源码)
    查看>>
    Objective-C实现BitMap算法(附完整源码)
    查看>>
    Objective-C实现bitonic sort双调排序算法(附完整源码)
    查看>>
    Objective-C实现bogo sort排序算法(附完整源码)
    查看>>
    Objective-C实现boruvka博鲁夫卡算法(附完整源码)
    查看>>
    Objective-C实现Boyer-Moore字符串搜索算法(附完整源码)
    查看>>