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[bk]12.5
[bk][bk]5[bk]0:23:21[bk]0:25:01
[bk]42[bk]0:23:32[bk]-:--:--
[bk][bk]7[bk]0:33:20[bk]0:41:35
Sample Output
[bk][bk]5:[bk]3:52[bk]min/km
[bk]42:[bk]-
[bk][bk]7:[bk]6:00[bk]min/km
题目大意:
接力赛,求队伍平均时间。如果遇到 -:--:-- 取消比赛情况的,直接输出 -
思路:
这个题没啥,主要是卡输入和输出,队伍的名字是三个字符长度,然后输出时间之间 还有 : 这个分隔符,显然用cin 然后 gerchar() 的话,可能会出现不可知的错误。用scanf 就比较简单了。
感想:
不太喜欢用scanf 看着书上写的。总觉着没有cin可爱。不过遇到一大堆数据的输入的时候,scanf 的确很快可以避免超时。好像是因为cin是同步输入的吧。
AC代码:
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
}