#include<bits/stdc++.h>
using namespace std;
int n;
int kase;
int D;
double p[15];
double L[15];
double v[15];
int main()
{
while(~scanf("%d %d",&n,&D)&&(n+D))
{
double ans=0;
for(int i=1;i<=n;i++)
{
scanf("%lf %lf %lf",&p[i],&L[i],&v[i]);
ans+=p[i]-p[i-1]-L[i-1];
ans+=2*L[i]/v[i];
}
ans+=D-p[n]-L[n];
printf("Case %d: ",++kase);
printf("%.3lf\n",ans);
puts("");
}
return 0;
}
全期望(过河,uva 12230)
最新推荐文章于 2023-11-13 01:08:08 发布