1036 Average is not Fast Enough!
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.
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.
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.
2 12.5 5 0:23:21 0:25:01 42 0:23:32 -:--:-- 7 0:33:20 0:41:35
5: 3:52 min/km 42: - 7: 6:00 min/km
University of Ulm Local Contest 2001
代码
/**
* Presentation:水题 时间的100进制和60进制的转换
*
* Author: Vincent
* Time:Sep 15, 2010 10:13:18 AM
* ZheJiang University
*/
package HDOJ;
import java.io.BufferedInputStream;
import java.util.Scanner;
public class hdoj1036{
//public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
String str[] = new String[1000];
int a[] = new int[10];
int len,i,j,n,num=0;
boolean flag = false;
double sum,totalDis,t,t1,vMin,vSecond;
Scanner cin = new Scanner(new BufferedInputStream(System.in));
while(cin.hasNextInt())
{
n = cin.nextInt();
totalDis = cin.nextDouble();
while(cin.hasNextInt())
{
num = cin.nextInt();
for(i=0;i<10;i++)
a[i]=0;
flag=false;
for(i=0;i<n;i++)
str[i] = cin.next();
for(i=0;i<n;i++)
{
//已经被取消资格
if(str[i].charAt(0) == '-')
{
flag =true;
break;
}
else
{
a[0] = 0;
for(j=0 ; str[i].charAt(j) != ':' ; j++)
{
a[0] *= 10;
a[0] += str[i].charAt(j) - '0';
}
//小数部分可能为一位数或者两位数
a[1] += a[0];
a[2] += (str[i].charAt(j+1) - '0')*10 + (str[i].charAt(j+2) - '0');
a[3] += (str[i].charAt(j+4) - '0')*10 + (str[i].charAt(j+5) - '0');
}
}
//如果失去资格 只输出队名和 : --
if(flag)
System.out.printf("%3d: -\n",num);
else
{
t = a[1]*1.0*60 + a[2]*1.0 + a[3]*1.0/60;
vMin = t/totalDis;
vSecond = (vMin - (int)vMin)*60;
if(vSecond - (int)vSecond >= 0.5)
vSecond++;
if((int)vSecond >= 60)
{
vSecond -= 60;
vMin += 1;
}
System.out.printf("%3d: %d:%02d min/km\n",num,(int)vMin,(int)vSecond);
}
}
}
}
}


浙公网安备 33010602011771号