hdu1036 Average is not Fast Enough!（水题一枚）

hdu1036 Average is not Fast Enough!（水题一枚）

Average is not Fast Enough!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6159    Accepted Submission(s): 2576

Problem Description

A relay is a race for two or more teams of runners. Each member of a team runs one section of the race. Your task is to help to evaluate the results of a relay race.  You have to process several teams. For each team you are given a list with the running times for every section of the race. You are to compute the average time per kilometer over the whole distance. That's easy, isn't it?  So if you like the fun and challenge competing at this contest, perhaps you like a relay race, too. Students from Ulm participated e.g. at the "SOLA" relay in Zurich, Switzerland. For more information visit after the contest is over.

Input

The first line of the input specifies the number of sections n followed by the total distance of the relay d in kilometers. You may safely assume that 1 <= n <= 20 and 0.0 < d < 200.0. Every following line gives information about one team: the team number t (an integer, right-justified in a field of width 3) is followed by the n results for each section, separated by a single space. These running times are given in the format "h:mm:ss" with integer numbers for the hours, minutes and seconds, respectively. In the special case of a runner being disqualified, the running time will be denoted by "-:--:--". Finally, the data on every line is terminated by a newline character. Input is terminated by EOF.

Output

For each team output exactly one line giving the team's number t right aligned in a field of width 3, and the average time for this team rounded to whole seconds in the format "m:ss". If at least one of the team's runners has been disqualified, output "-" instead. Adhere to the sample output for the exact format of presentation.

Sample Input

2 12.5 5 0:23:21 0:25:01 42 0:23:32 -:--:-- 7 0:33:20 0:41:35

Sample Output

5: 3:52 min/km 42: - 7: 6:00 min/km

Source

​​University of Ulm Local Contest 2001​​

Recommend

We have carefully selected several similar problems for you:   ​​1031​​​  ​​​1037​​​  ​​​1038​​​  ​​​1032​​​  ​​​1033​​

​​Statistic​​ | ​​Submit​​ | ​​Discuss​​ | ​​Note​​

#include #include #include int main(){ double l; int n; scanf("%d %lf",&n,&l); int name; while(~scanf("%d",&name)) { char str[20]; memset(str,0,sizeof(str)); bool flag=false; double seconds=0; for(int k=0;k='0'&&str[j]<='9') { sum=sum*10+str[j]-'0'; } else if(str[j]==':') { if(index==0) { seconds+=sum*3600; sum=0; index++; } else if(index==1) { seconds+=sum*60; sum=0; index++; } } } seconds+=sum; } if(flag) { printf("%3d: -\n",name); continue; } double v=seconds/l; if(v-floor(v)>=0.5)//四舍五入 v++; v=floor(v); double hour=floor(v/60); double minu=v-hour*60; if(minu==0) { printf("%3d: %.lf:00 min/km\n",name,hour); } else if(minu<10) { printf("%3d: %.lf:0%.lf min/km\n",name,hour,minu); } else { printf("%3d: %.lf:%.lf min/km\n",name,hour,minu); } } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。