水题....
#include<cstdio>
#include<algorithm>
#include<cstring>
#define SF scanf
#define PF printf
using namespace std;
typedef long long LL;
const int MAXN = 10;
int main()
{
int n, D, p, L, v, kase = 0;
while(~SF("%d%d", &n, &D) && n + D)
{
int Len = 0;
double ans = 0;
for(int i = 1; i <= n; i++)
{
SF("%d%d%d", &p, &L, &v);
ans += 2.0 * L / v; Len += L;;
}
Len = D - Len;
ans += Len;
PF("Case %d: %.3lf\n\n", ++kase, ans);
}
}