zoukankan      html  css  js  c++  java
  • HDU 2061 Treasure the new start, freshmen!

    http://acm.hdu.edu.cn/showproblem.php?pid=2061

    Problem Description
    background:
    A new semester comes , and the HDU also meets its 50th birthday. No matter what's your major, the only thing I want to tell you is:"Treasure the college life and seize the time." Most people thought that the college life should be colorful, less presure.But in actual, the college life is also busy and rough. If you want to master the knowledge learned from the book, a great deal of leisure time should be spend on individual study and practise, especially on the latter one. I think the every one of you should take the learning attitude just as you have in senior school.
    "No pain, No Gain", HDU also has scholarship, who can win it? That's mainly rely on the GPA(grade-point average) of the student had got. Now, I gonna tell you the rule, and your task is to program to caculate the GPA.
    If there are K(K > 0) courses, the i-th course has the credit Ci, your score Si, then the result GPA is
    GPA = (C1 * S1 + C2 * S2 +……+Ci * Si……) / (C1 + C2 + ……+ Ci……) (1 <= i <= K, Ci != 0)
    If there is a 0 <= Si < 60, The GPA is always not existed.
     
    Input
    The first number N indicate that there are N test cases(N <= 50). In each case, there is a number K (the total courses number), then K lines followed, each line would obey the format: Course-Name (Length <= 30) , Credits(<= 10), Score(<= 100).
    Notice: There is no blank in the Course Name. All the Inputs are legal
     
    Output
    Output the GPA of each case as discribed above, if the GPA is not existed, ouput:"Sorry!", else just output the GPA value which is rounded to the 2 digits after the decimal point. There is a blank line between two test cases. 
     
    Sample Input
    2 3
    Algorithm 3 97
    DataStruct 3 90
    softwareProject 4 85
    2
    Database 4 59
    English 4 81
     
    Sample Output
    90.10
    Sorry!
     
    代码:
    #include <bits/stdc++.h>
    using namespace std;
    
    int main()
    {
        int T;
        char name[50];
        double num[1111],score[1111];
        scanf("%d",&T);
        for(int i=1; i<=T; i++)
        {
            if(i!=1)
                printf("
    ");
            int x,flag=0;
            scanf("%d",&x);
            double sum=0,ans=0;
            for(int j=1; j<=x; j++)
            {
                scanf("%s%lf%lf",name,&num[j],&score[j]);
                if(score[j]<60)
                    flag=1;
                sum+=num[j]*score[j];
                ans+=num[j];
            }
            //cout<<sum<<" "<<ans<<" "<<flag<<endl;
            if(flag==0)
                printf("%.2lf
    ",sum/ans);
            else
                printf("Sorry!
    ");
        }
        return 0;
    }
    

      

  • 相关阅读:
    23种设计模式之原子模式
    23种设计模式之外观模式(门面模式)
    Docker指令记录
    mysql 引擎
    G1调优随笔
    jvm面试题 新生代和 老年代的区别
    java虚拟机栈 相关操作
    .net大法总章
    .net趣味面试题总结
    IOC控制反转-依赖注入
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9380152.html
Copyright © 2011-2022 走看看