//UVA12230CrossingRivers
#include<cstdio>
#include<cstring>
const int maxn = 10 + 5;
double L[maxn], v[maxn];
int main() {
int n, kase = 0;
double D;
while(scanf("%d%lf", &n, &D) == 2 && D) {
double sum_L = 0, sum_E = 0;
for(int i = 0; i < n; i++) {
scanf("%*lf%lf%lf", &L[i], &v[i]);
sum_L += L[i]; sum_E += 2 * L[i] / v[i];
}
double ans = D - sum_L + sum_E;
printf("Case %d: %.3lf\n\n", ++kase, ans);
}
return 0;
}
/*
1 1
0 1 2
0 1
0 0
*/
UVA12230CrossingRivers
最新推荐文章于 2017-09-07 00:51:10 发布