Comments
0

It was a thrilling match. In the last three minutes, I came up with a solution, but I didn't have time to write. I am tooooo weak
+2

Wow, I like have a codeforces round everyday.
On robinyu → Codeforces Round #419, 9 years ago
+3

It is a welfare of otuka!!Nice picture.
0

This is the binary search.For double, you just iterate enough times to improve your accuracy.This just like the common binary search. I think you will know it.
+2 
const double MAX = 1e7;
double s(double &t)
{
    double l = 0, r = MAX, mid;
    for (int i = 0; i < 1000; ++i)
    {
        mid = (r+l)/2;
        if(mid*mid > t) r = mid;
        else l = mid;
    }
    return mid;
}
0

Nice, brother.
0

why problem B。 the input abc aaa

and the output is aab.

why is not aba.
+74

What a beautiful solution for E