HDU 2061 Treasure the new start, freshmen!
来源:互联网 发布:游戏角色设计软件 编辑:程序博客网 时间:2024/06/05 08:12
Treasure the new start, freshmen!
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11190 Accepted Submission(s): 3484
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.
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
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
23Algorithm 3 97DataStruct 3 90softwareProject 4 852Database 4 59English 4 81
Sample Output
90.10Sorry!
虽是一水题,却很坑!!!
#include<stdio.h>#include<algorithm>#include<math.h>using namespace std;struct record{ char course[100]; double c; double score;}num[1000];int main(){ int n,m,i; int k; double GPA,sum; scanf("%d",&n); while(n--) { scanf("%d",&m); k=1;GPA=sum=0; for(i=0;i<m;i++) { scanf("%s %lf %lf",num[i].course,&num[i].c,&num[i].score); if(num[i].score>=0&&num[i].score<60) k=0; GPA+=num[i].c*num[i].score; sum+=num[i].c; } if(k!=0) printf("%.2lf\n",GPA/sum); else printf("Sorry!\n"); if(n>0) printf("\n"); } return 0;}
0 0
- hdu 2061 Treasure the new start, freshmen!
- HDU 2061 Treasure the new start, freshmen!
- HDU 2061 Treasure the new start, freshmen!
- HDU——2061 Treasure the new start, freshmen!
- HDOJ(HDU) 2061 Treasure the new start, freshmen!(水题、)
- HDU ACM 11 2061 Treasure the new start, freshmen!
- Treasure the new start, freshmen! 2061
- hdoj 2061 Treasure the new start, freshmen!
- HDOJ 2061 Treasure the new start, freshmen!
- hdoj 2061 Treasure the new start, freshmen!
- Treasure the new start, freshmen!
- Treasure the new start, freshmen!
- Treasure the new start, freshmen!
- hdoj 2061 Treasure the new start, freshmen!(结构体)
- HDU 2061 Treasure the new start, freshmen!(GPA的计算)
- HDU2061 Treasure the new start, freshmen!【水题】
- hdu2061--Treasure the new start, freshmen!
- hdu2061 Treasure the new start, freshmen!
- 【SQL】数据库的备份与还原
- 【JS/JQuery】使用JS去除文本框前…
- 【JS/JQ】判断文本框输入的只能是…
- setlocale同mbstowcs函数的关系
- .NET Oracle Developer的福音——ODP.NET Managed正式推出
- HDU 2061 Treasure the new start, freshmen!
- 利用字典树查找唯一标记某单词的最小前缀
- 求最大子序列的实现
- unity3D--数据库
- 替换掉字符串中的空格
- Java中的static关键字解析
- 韩顺平php视频笔记38-41 php数据类型(部分)
- POJ 2387 Til the Cows Come Home
- ThinkPHP3.1.3核心类 Dispatcher.class.php