As Fast As Possible
小学奥数题
double n,k;
double l,v1,v2;
cin>>n>>l>>v1>>v2>>k;
double S=ceil((double)n/k);
double T=(2*S-1)*v2+v1;
T/=(2*S-1)*v1*v2+v2*v2;
printf("%.9lf\n",T*l);
return 0;
Connecting Universities
树的带权重心到所有点距离和