谁拿到了最多奖学金

来源：互联网发布：python 安卓编辑：程序博客网时间：2024/05/16 08:03

这里写图片描述

c语言做法：

#include<stdio.h>typedef struct {    char name[20];      //姓名    int grade1;     //平均成绩    int grade2;     //班级评议成绩    char p;     //是否为学生干部    char q;     //是否为西部学生    int num;    //论文数量    int sum;    //奖金总数}Node;void shuru(Node *str, int n)        //输入{    for (int i = 0; i < n; i++)    {        scanf("%s%d%d %c %c%d", str[i].name, &str[i].grade1, &str[i].grade2, &str[i].p, &str[i].q, &str[i].num);        getchar();    }}void f1(Node *str)  //判断是否满足院士奖学金{    if (str->grade1 > 80 && str->num >= 1)        str->sum += 8000;}void f2(Node *str)  //判断是否满足五四奖学金{    if (str->grade1 > 85 && str->grade2 > 80)        str->sum += 4000;}void f3(Node *str)  //判断是否满足成绩优秀奖{    if(str->grade1 > 90)            str->sum += 2000;}void f4(Node *str)  //判断是否满足西部奖学金{    if (str->grade1 > 85 && str->q == 'Y')        str->sum +=1000;}void f5(Node *str)  //判断是否满足班级贡献奖{    if (str->grade2 > 80 && str->p == 'Y')        str->sum += 850;}Node find_sum_max(Node *str, int n) //寻找奖学金最大的{    int temp = str[0].sum;    int t = 0;  //用来记住位置，便于返回    for (int i = 0; i < n; i++)    {        if (temp < str[i].sum)        {            temp = str[i].sum;            t = i;        }           }    return str[t];}void print(Node *str, Node *temp, int n)    //计算总奖金数并输出{    int n_sum = 0;    for (int i = 0; i < n; i++)    {        n_sum = n_sum + str[i].sum;    }    printf("%s\n%d\n%d\n", temp->name, temp->sum, n_sum);}int main(){    Node str[100] = {0};    int n;  //n个人    scanf("%d", &n);    getchar();    shuru(str, n);    for (int i = 0; i < n; i++)    {        f1(&str[i]);        f2(&str[i]);        f3(&str[i]);        f4(&str[i]);        f5(&str[i]);    }    Node temp = find_sum_max(str, n);    print(str, &temp, n);    return 0;}

c++做法1：

#include<iostream>using namespace std;int main(){    string a,g;    int b,c,f,n,money=0,result=0,sum=0;    char d,e;    cin>>n;    for(int i=1;i<=n;i++)    {        cin>>a>>b>>c>>d>>e>>f;        money=0;        if(b>80&&f>=1)        money+=8000;        if(b>85&&c>80)        money+=4000;        if(b>90)        money+=2000;        if(b>85&&e=='Y')        money+=1000;        if(c>80&&d=='Y')        money+=850;        sum+=money;        if(result<money)        {            result=money;            g=a;        }    }    cout<<g<<endl<<result<<endl<<sum<<endl;    return 0;}

c++做法2：

#include<iostream>#include"vector"using namespace std;class Student{public:    char name[20];      //姓名    int grade1;     //平均成绩    int grade2;     //班级评议成绩    char p;     //是否为学生干部    char q;     //是否为西部学生    int num;    //论文数量    int sum;    //奖金总数public:     void f1()   //判断是否满足院士奖学金    {        if (this->grade1 > 80 && this->num >= 1)            this->sum += 8000;    }       void f2()   //判断是否满足五四奖学金    {        if (this->grade1 > 85 && this->grade2 > 80)            this->sum += 4000;    }    void f3()   //判断是否满足成绩优秀奖    {               if(this->grade1 > 90)               this->sum += 2000;    }    void f4()   //判断是否满足西部奖学金    {           if (this->grade1 > 85 && this->q == 'Y')            this->sum +=1000;    }    void f5()   //判断是否满足班级贡献奖    {        if (this->grade2 > 80 && this->p == 'Y')            this->sum += 850;    }};void shuru(vector<Student>& student, int n){    Student temp;    while (n--)     //输入    {        cin >> temp.name >> temp.grade1 >> temp.grade2 >> temp.p >> temp.q >> temp.num;        student.push_back(temp);    }}Student find_sum_max(vector<Student>& student, int n)   //寻找奖学金最大的{    int temp = student[0].sum;    int t = 0;  //用来记住位置，便于返回    for (int i = 0; i < n; i++)    {        if (temp < student[i].sum)        {            temp = student[i].sum;            t = i;        }    }    return student[t];}void print(vector<Student>& student, Student &temp, int n)  //计算总奖金数并输出{    int n_sum = 0;    for (int i = 0; i < n; i++)    {        n_sum = n_sum + student[i].sum;    }    cout << temp.name << endl << temp.sum << endl << n_sum << endl;}int main(){    vector<Student> student;    int n;    //n个学生    cin >> n;    shuru(student, n);    for (int i = 0; i < n; i++)    {           student[i].f1();        student[i].f2();        student[i].f3();        student[i].f4();        student[i].f5();        }    Student temp = find_sum_max(student, n);    print(student, temp, n);    cout << endl;    for (int i = 0; i < n; i++)    {        cout << student[i].name << " " << student[i].sum << endl;    }    return 0;}

阅读全文

1 0