Do we need to have the same email id linked with the codechef account as the one used for registration?

Aight bet

Me too. That's why I was trying to cheese it in somehow, but it just didn't work.

Why doesn't binary search work for F? Is it because the required precision is not achievable under the given constraints for the iterations of the binary search?

During the contest, we did come up with a similar idea but dismissed it quickly, assuming a simpler one existed due to the high number of accepted submissions. Unfortunately, this decision led to us not solving the problem. Looking back, it would have been wiser to proceed with this approach regardless.

You can use FFT for E2 and some continued fractions or rational approximation to find the number of points under the line in C.

Hope this helps those looking for older problems.

A mirror contest will be held.

I have replaced the bit.ly links with the original ones. Can you please check now?

Both rounds will have around 7 to 9 problems.

There will be 7 — 9 problems.

Greedily, it always makes sense to select one of the p nodes as the server ... Hence, when a node is chosen for k it remains.

And now I am traumatized T_T

I tried stress testing, but its throwing the following error: Error compiling brute.cpp: Failed to compile brute.cpp (nonzero exit code)

Though the file is executing properly when I execute it. How to resolve this?

Welp there goes my elo

Probably an overkill but E can be solved using Euler Tour and Seg Tree . Code

It was (mid-a[i]) so it overflowed ... Damn I am stupid

Had the exact same idea ... dont know where it went wrong ... help

sorry

sorry