SDAU 1007
2016-04-05 19:45
295 查看
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
[bk][bk]5:[bk]3:52[bk]min/km
[bk]42:[bk]-
[bk][bk]7:[bk]6:00[bk]min/km
题目大意:
接力赛,求队伍平均时间。如果遇到 -:--:-- 取消比赛情况的,直接输出 -
思路:
这个题没啥,主要是卡输入和输出,队伍的名字是三个字符长度,然后输出时间之间 还有 : 这个分隔符,显然用cin 然后 gerchar() 的话,可能会出现不可知的错误。用scanf 就比较简单了
AC代码
#include
#include
#include
#include
#include
#include
using namespace std;
int main()
{
//freopen("r.txt", "r", stdin);
int n,t,h,m,s,i,sum;
char arr[100];
double d;
cin>>n>>d;
while(~scanf("%d",&t))
{
int work=sum=0;
for(i=0;i
{
if(scanf("%d:%d:%d",&h,&m,&s)==3)
{
sum+=h*3600+m*60+s;
}
else
{
gets(arr);
work=1;
break;
}
}
if(work)
{
cout<<setw(3)<<t<<": -"<<endl;
}
else
{
sum=sum/d+0.5;
cout<<setw(3)<<t<<": "<<sum/60<<":";
if((sum`)<10)
cout<<0;
cout<<sum`<<" min/km"<<endl;
}
}
}
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
[bk][bk]5:[bk]3:52[bk]min/km
[bk]42:[bk]-
[bk][bk]7:[bk]6:00[bk]min/km
题目大意:
接力赛,求队伍平均时间。如果遇到 -:--:-- 取消比赛情况的,直接输出 -
思路:
这个题没啥,主要是卡输入和输出,队伍的名字是三个字符长度,然后输出时间之间 还有 : 这个分隔符,显然用cin 然后 gerchar() 的话,可能会出现不可知的错误。用scanf 就比较简单了
AC代码
#include
#include
#include
#include
#include
#include
using namespace std;
int main()
{
//freopen("r.txt", "r", stdin);
int n,t,h,m,s,i,sum;
char arr[100];
double d;
cin>>n>>d;
while(~scanf("%d",&t))
{
int work=sum=0;
for(i=0;i
{
if(scanf("%d:%d:%d",&h,&m,&s)==3)
{
sum+=h*3600+m*60+s;
}
else
{
gets(arr);
work=1;
break;
}
}
if(work)
{
cout<<setw(3)<<t<<": -"<<endl;
}
else
{
sum=sum/d+0.5;
cout<<setw(3)<<t<<": "<<sum/60<<":";
if((sum`)<10)
cout<<0;
cout<<sum`<<" min/km"<<endl;
}
}
}
相关文章推荐
- 第6周项目1:分数类的雏形
- Codeforces Round #252(Div. 2) 441A. Valera and Antique Items 水题
- 子类的实例化过程
- 为RecyclerView打造万能适配器
- 算法:插入排序
- Project Euler:Problem 86 Cuboid route
- WSP_mainActivity
- 《Swift入门》关于Swift
- 58 单例模式与auto_ptr
- SDAU 1006
- ZOJ 1002 Fire Net
- Nginx的负载均衡 - 一致性哈希 (Consistent Hash)
- oracle物理dg状态检查
- hdu 3500 DFS(限定)
- 【Data Algorithms_Recipes for Scaling up with Hadoop and Spark】Chapter 12. K-Means Clustering
- RadioGroup标签及游标展示
- UVa 10340, All in All
- 第五周项目2-游戏中的角色类(1)
- SDAU 1004
- 20145229吴姗珊《Java程序设计》2天总结