HDU 1036 求平均速度
来源:互联网 发布:淘宝退货退款流程图解 编辑:程序博客网 时间:2024/05/01 23:21
HDU 1036
Average is not Fast Enough!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5541 Accepted Submission(s): 2250
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 http://www.sola.asvz.ethz.ch/ after the contest is over.
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 http://www.sola.asvz.ethz.ch/ 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 1039 1037 1038 1032
大水题,题大意是告诉你距离,组号,每组两个人各自的耗时,求平均速度。注意格式!!!
#include <iostream>#include <cstdio>using namespace std;int main(){ int i,n,sum,h,m,s,flag,t;char str[500];float d;scanf("%d%f",&n,&d);while(scanf("%d",&t)!=EOF){flag=1,sum=0;for(i=0;i<n&&flag;i++){if(scanf("%d:%d:%d",&h,&m,&s)==3)sum+=h*3600+m*60+s;else{gets(str);flag=0;}}if(flag){sum=sum/d+0.5;printf("%3d: %d:%02d min/km\n",t,sum/60,sum%60);}elseprintf("%3d: -\n",t);}return 0;}
0 0
- HDU 1036 求平均速度
- 上机项目--求平均速度
- 求运动员的平均速度
- 求百米运动员的平均速度
- Biker's Trip Odometer(求平均速度)
- 行测之等距离平均速度问题
- hdu 2003 求绝对值
- HDU 1251 求前缀
- hdu--2080 求角度
- HDU 2003 求绝对值
- hdu求平均成绩
- HDU 1212求余
- HDU 2003 求绝对值
- hdu-求平均成绩
- hdu-2003-求绝对值
- HDU 2003 - 求绝对值
- HDU 2003 求绝对值
- [hdu 2003] 求绝对值
- Android底层开发之红外遥控驱动移植
- 揭开RecyclerView的神秘面纱(一):RecyclerView的基本使用
- hdu1171 Big Event in HDU(01背包)
- 广义表
- OpenCv读取一段视频
- HDU 1036 求平均速度
- 网龙现场笔试电话面试经历
- iOS 循环引用问题
- Android菜单详解(一)——理解android中的Menu
- Java\Scala\Python三种语言求解经典编程实例(二)—— 尾数前移
- a:link,a:visited,a:hover,a:active
- 学生信息管理系统总结(二)
- calcHist()计算图像直方图opencv
- 在keil4新建一个STM32L152工程