HDU-1036
2016-08-24 08:03
288 查看
Average is not Fast Enough!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5691 Accepted Submission(s): 2353
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.
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
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int i;int n;
double dis,result;
int team,ans;
char a[100];
bool flag;
scanf("%d %lf",&n, &dis);
while(scanf("%d",&team)!=EOF)
{
flag=true;
result=0;
for(i=0;i<n;i++)
{scanf("%s",a);
if(a[0]=='-')
{
flag=false;
}
else
{
result += (a[0] - '0') * 3600;
result += ((a[2] - '0') * 10 + (a[3] - '0')) * 60;
result += (a[5] - '0') * 10 + (a[6] - '0');
}//else
}//for
result/=dis;
ans=result+0.5;//四舍五入
if(flag) printf("%3d:%2d:%02d min/km\n", team, ans/ 60, ans % 60);//注意 秒如果是0 要输出00
else printf("%3d: -\n", team);
}//while
return 0;
}
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5691 Accepted Submission(s): 2353
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.
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
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int i;int n;
double dis,result;
int team,ans;
char a[100];
bool flag;
scanf("%d %lf",&n, &dis);
while(scanf("%d",&team)!=EOF)
{
flag=true;
result=0;
for(i=0;i<n;i++)
{scanf("%s",a);
if(a[0]=='-')
{
flag=false;
}
else
{
result += (a[0] - '0') * 3600;
result += ((a[2] - '0') * 10 + (a[3] - '0')) * 60;
result += (a[5] - '0') * 10 + (a[6] - '0');
}//else
}//for
result/=dis;
ans=result+0.5;//四舍五入
if(flag) printf("%3d:%2d:%02d min/km\n", team, ans/ 60, ans % 60);//注意 秒如果是0 要输出00
else printf("%3d: -\n", team);
}//while
return 0;
}
相关文章推荐
- hdu_1036(取整和格式控制)
- hdu_1036_Average is not Fast Enough_201311021335
- hdu 1036 String Matching
- HDU 1036 Average is not Fast Enough!
- HDU 1036 字符串模拟题
- HDU 1036 Average is not Fast Enough! (水题)
- hdu1036 Average is not Fast Enough!(水题一枚)
- HDU 1036 Average is not Fast Enough!:题目解答源码
- HDU 1036 Average is not Fast Enough! 模拟
- HDU-1036 Average is not Fast Enough!(模拟水题)
- HDU 1036 Average is not Fast Enough!【水】
- hdu 1036
- HDU 1036 Average is not Fast Enough!
- hdu 1036 (水题控制输入输出格式)
- hdu 1036 (字符串)
- HDU1036 - Average is not Fast Enough! (简单题)
- HDU 1036 Average is not Fast Enough!
- HDU 1036 求平均速度
- HDU 1036 Average is not Fast Enough!(水题)
- hdu 1036 水题