关闭

hdoj 2061 Treasure the new start, freshmen!(结构体)

标签: hdoj 2061Treasure the new stafreshmen水题
158人阅读 评论(0) 收藏 举报
分类:

Treasure the new start, freshmen!

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13374    Accepted Submission(s): 4068


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<stdio.h>
struct node
{
	char course[50];
	double  credit;
	double score;
}a[1100];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n,i,j,flag=0;
		scanf("%d",&n);
		double  sum=0.0,cnt=0.0;
		for(i=0;i<n;i++)
		{
			scanf("%s %lf %lf",a[i].course  ,&a[i].credit ,&a[i].score );
			if(a[i].score <60&&a[i].score >=0)
			{
				flag=1;
			}
			sum+=a[i].credit *a[i].score ;
			cnt+=a[i].credit ;
		}
		if(flag)
		printf("Sorry!\n");
		else
		{
			printf("%.2lf\n",sum/cnt);
		}
		if(t)
		printf("\n");
	}
	return  0;
 } 

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:54569次
    • 积分:3053
    • 等级:
    • 排名:第11459名
    • 原创:257篇
    • 转载:10篇
    • 译文:0篇
    • 评论:3条