栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > C/C++/C#

西安交通大学915-2016-编程3

C/C++/C# 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

西安交通大学915-2016-编程3

题目描述:

代码实现:
#include 
using namespace std;

enum STATUS {
    NORMAL = 0,  // 正常
    LATE = 1,    // 迟到
    LEAVE = 2,   // 请假
    ABSENT = 3   // 旷课
};

struct Student {
    int id;
    int course[4];
    int sum;
};

const int N = 110;
Student arr[N];

int main() {
    int n, sum;
    cout << "please input the number of student:";
    cin >> n;
    cout << "please input the number of course:";
    cin >> sum;
    for (int i = 0; i < n; i++) {
        cout << "please input the student's id:";
        cin >> arr[i].id;
        cout << "please input the student's course status:";
        int status;
        cin >> status;
        arr[i].course[status]++;
        arr[i].sum = sum;
    }
    
    // 每个人的出勤情况
    for (int i = 0; i < n; i++) {
        double normal_rate = 1.0 * (arr[i].course[0]) / arr[i].sum;
        double late_rate = 1.0 * (arr[i].course[1]) / arr[i].sum;
        double leave_rate = 1.0 * (arr[i].course[2]) / arr[i].sum;
        double absent_rate = 1.0 * (arr[i].course[3]) / arr[i].sum;
        printf("id = %d, normal_rate = %lf, late_rate = %lf, leave_rate = %lf, absent_rate = %lfn", arr[i].id, normal_rate, late_rate, leave_rate, absent_rate);
    }

    int normal = 0;
    int late = 0;
    int leave = 0;
    int absent = 0;

    for (int i = 0; i < n; i++) {
        normal += arr[i].course[0];
        late += arr[i].course[1];
        leave += arr[i].course[2];
        absent += arr[i].course[3];
    }

    // 课程的情况
    printf("course : normal_rate = %lf, late_rate = %lf, leave_rate = %lf, absent_rate = %lfn",
        normal * 1.0 / n * sum, late * 1.0 / n * sum, leave * 1.0 / n * sum, absent * 1.0 / n * sum);
    return 0;
}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/656256.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号