//poj 2565
//sep9
#include <iostream>
using namespace std;
char s[16];
int get_second()
{
if(s[0]=='-')
return -1;
int H,M,S;
H=s[0]-'0';
M=10*(s[2]-'0')+s[3]-'0';
S=10*(s[5]-'0')+s[6]-'0';
return H*3600+M*60+S;
}
void print(int sum,double d)
{
double tmp=(double)sum/d;
int ans=(int)(tmp+0.5);
int M=ans/60,S=ans%60;
if(S>=10)
printf("%d:%d min/km\n",M,S);
else
printf("%d:0%d min/km\n",M,S);
}
int main()
{
int n;
double d;
scanf("%d%lf",&n,&d);
int ids;
while(scanf("%d",&ids)==1){
int sum=0,flag=0;
for(int i=0;i<n;++i){
scanf("%s",s);
int t=get_second();
if(t==-1) flag=1;
else sum+=t;
}
printf("%3d: ",ids);
if(flag==1)
puts("-");
else
print(sum,d);
}
return 0;
}
poj 2565 Average is not Fast Enough! 水题
最新推荐文章于 2019-02-08 17:38:47 发布