首页 > ACM题库 > HDU-杭电 > HDU 1036 Average is not Fast Enough!-字符串-[解题报告] C++
2013
11-26

HDU 1036 Average is not Fast Enough!-字符串-[解题报告] C++

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

点击打开链接

刚开始都没看懂题目什木意思。。

注意格式的输入

#include"stdio.h"
#include"string.h"
#include"math.h"
int main()
{
	int n,i;
	int sum,t;
	int h,m,s;
	char str[101];
	double d;
	scanf("%d%lf",&n,&d);
	while(scanf("%d",&t)!=-1)
	{
		int f;
		sum=0;f=1;
		for(i=0;i<n&&f;i++)
		{		
			if(scanf("%d:%d:%d",&h,&m,&s)==3)
				sum+=h*3600+m*60+s;
			else 
			{
				gets(str);
				f=0;
			}
		}
		if(f==0)
			printf("%3d: -\n",t);
		else 
		{
			sum=sum/d+0.5;
			printf("%3d: %d:%02d min/km\n",t,sum/60,sum%60);
		}
	}
	return 0;
}


  1. 这道题这里的解法最坏情况似乎应该是指数的。回溯的时候
    O(n) = O(n-1) + O(n-2) + ….
    O(n-1) = O(n-2) + O(n-3)+ …
    O(n) – O(n-1) = O(n-1)
    O(n) = 2O(n-1)

  2. Thanks for using the time to examine this, I truly feel strongly about it and enjoy finding out far more on this subject matter. If achievable, as you achieve knowledge

  3. 样例输出和程序输出不吻合,修改一下样例输出吧。我用的是VC编译器,会提示我的i和j变量重复定义