zoukankan      html  css  js  c++  java
  • HDU 1036Average is not Fast Enough!

     1 #include<stdio.h>
    2 int main()
    3 {
    4 int k,i,j,n,total,h,m,ss,flag,s,a;
    5 float d;
    6 scanf("%d%f",&n,&d);
    7 while(scanf("%d",&a)!=EOF)
    8 {
    9 flag = 0;
    10 total = 0;
    11 for(i = 0 ; i < n ; i++)
    12 {
    13 if(scanf("%d:%d:%d",&h,&m,&ss)==3)
    14 total = total+ h*3600+m*60+ss;
    15 else
    16 {
    17 scanf(":--:--");
    18 flag = 1;
    19 }
    20 }
    21 if(flag == 1)
    22 printf("%3d: -\n",a);
    23 else
    24 {
    25 k = total/d+0.5;//因为是整型会把小数部分省略 +上0.5 会把小数部分算上
    26 m = k/60;
    27 ss = k%60;
    28 printf("%3d: %d:%02d min/km\n",a,m,ss);
    29 }
    30 }
    31 return 0;
    32 }
    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
     
  • 相关阅读:
    Codeforces Beta Round #9 (Div. 2 Only) C. Hexadecimal's Numbers dfs
    Codeforces Beta Round #9 (Div. 2 Only) B. Running Student 水题
    Codeforces Beta Round #9 (Div. 2 Only) A. Die Roll 水题
    51nod 1035 最长的循环节 数学
    BSGS 模板
    51nod 1040 最大公约数之和 欧拉函数
    51NOD 1179 最大的最大公约数 筛法
    BZOJ 2818: Gcd 筛法
    川大校赛总结
    SCOJ 4484 The Graver Robbers' Chronicles 后缀自动机
  • 原文地址:https://www.cnblogs.com/shangyu/p/2366809.html
Copyright © 2011-2022 走看看