Codeforces Round #364 (Div. 1) 题解(待续)

• As Fast As Possible
• Connecting Universities

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=(*S-)*v2+v1;
    T/=(*S-)*v1*v2+v2*v2;
    printf("%.9lf\n",T*l);
    return ;
           

Connecting Universities

树的带权重心到所有点距离和