zoukankan      html  css  js  c++  java
  • Improving the GPA 分类: 贪心 HDU 比赛 2015-08-08 16:12 11人阅读 评论(0) 收藏

    Improving the GPA
    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
    Total Submission(s): 606 Accepted Submission(s): 451

    Problem Description
    Xueba: Using the 4-Point Scale, my GPA is 4.0.

    In fact, the AVERAGE SCORE of Xueba is calculated by the following formula:
    AVERAGE SCORE = ∑(Wi * SCOREi) / ∑(Wi) 1<=i<=N

    where SCOREi represents the scores of the ith course and Wi represents the credit of the corresponding course.

    To simplify the problem, we assume that the credit of each course is 1. In this way, the AVERAGE SCORE is ∑(SCOREi) / N. In addition, SCOREi are all integers between 60 and 100, and we guarantee that ∑(SCOREi) can be divided by N.

    In SYSU, the university usually uses the AVERAGE SCORE as the standard to represent the students’ level. However, when the students want to study further in foreign countries, other universities will use the 4-Point Scale to represent the students’ level. There are 2 ways of transforming each score to 4-Point Scale. Here is one of them.

    The student’s average GPA in the 4-Point Scale is calculated as follows:
    GPA = ∑(GPAi) / N

    So given one student’s AVERAGE SCORE and the number of the courses, there are many different possible values in the 4-Point Scale. Please calculate the minimum and maximum value of the GPA in the 4-Point Scale.

    Input
    The input begins with a line containing an integer T (1 < T < 500), which denotes the number of test cases. The next T lines each contain two integers AVGSCORE, N (60 <= AVGSCORE <= 100, 1 <= N <= 10).

    Output
    For each test case, you should display the minimum and maximum value of the GPA in the 4-Point Scale in one line, accurate up to 4 decimal places. There is a space between two values.

    Sample Input

    4
    75 1
    75 2
    75 3
    75 10

    Sample Output

    3.0000 3.0000
    2.7500 3.0000
    2.6667 3.1667
    2.4000 3.2000

    Hint
    In the third case, there are many possible ways to calculate the minimum value of the GPA in the 4-Point Scale.
    For example,
    Scores 78 74 73 GPA = (3.0 + 2.5 + 2.5) / 3 = 2.6667
    Scores 79 78 68 GPA = (3.0 + 3.0 + 2.0) / 3 = 2.6667
    Scores 84 74 67 GPA = (3.5 + 2.5 + 2.0) / 3 = 2.6667
    Scores 100 64 61 GPA = (4.0 + 2.0 + 2.0) / 3 = 2.6667

    Author
    SYSU

    Source
    2014 Multi-University Training Contest 9

    Recommend
    We have carefully selected several similar problems for you: 5363 5362 5361 5360 5359

    #include <map>
    #include <set>
    #include <list>
    #include <cmath>
    #include <queue>
    #include <stack>
    #include <vector>
    #include <string>
    #include <cstdio>
    #include <cstring>
    #include <cstdlib>
    #include <iostream>
    #include <algorithm>
    using namespace std;
    #define eps 1e-9
    #define LL long long
    #define PI acos(-1.0)
    #define INF 0x3f3f3f3f
    #define CRR fclose(stdin)
    #define CWW fclose(stdout)
    #define RR freopen("input.txt","r",stdin)
    #pragma comment(linker,"/STACK:102400000")
    #define WW freopen("output.txt","w",stdout)
    
    const int Max =  160000;
    
    double Trans(int s)
    {
        if(s>=85)
        {
            return 4;
        }
        else if(s>=80)
        {
            return 3.5;
        }
        else if(s>=75)
        {
            return 3;
        }
        else if(s>=70)
        {
            return 2.5;
        }
        else
        {
            return 2;
        }
    }
    
    int main()
    {
        int T;
        int n,m;
        int sum;
        double high,low;
        scanf("%d",&T);
        while(T--)
        {
            high=0;
            low=0;
            scanf("%d %d",&m,&n);
            sum=n*m-n*60;
            for(int i=0;i<n;i++)
            {
                if(sum>=25)
                {
                    sum-=25;
                    high+=4;
                }
                else
                {
                    high+=Trans(sum+60);
                    sum=0;
                }
            }
            sum=n*m-n*69;
            for(int i=0;i<n;i++)
            {
                if(sum>=31)
                {
                    sum-=31;
                    low+=4;
                }
                else
                {
                    low+=Trans(sum+69);
                    sum=0;
                }
            }
            printf("%.4f %.4f
    ",low/n,high/n);
        }
    
        return 0;
    }
    

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    MongoDB集群搭建-主从
    MongoDB集群搭建-副本集
    mongodb 复制集
    MongoDB高级知识-易使用
    MongoDB高级知识-易扩展
    【福布斯中文网】与任正非的一次花园谈话
    基于IG的特征评分方法
    数据挖掘方法论及实施步骤
    数据挖掘应用之:电信业离网预警建模过程
    常用的机器学习&数据挖掘知识点
  • 原文地址:https://www.cnblogs.com/juechen/p/4721911.html
Copyright © 2011-2022 走看看