Very fun problems, I like this contest!

But here seems to be a little mistake? I suppose it should be "The largest solution to $$$\lfloor n/k\rfloor \lt \lfloor \sqrt{n}\rfloor$$$".

Thank you so much!

I know how to prove $$$O(n)=O(k^2)$$$, but I don't know how $$$O(n^{k-2})$$$ comes out (especially $$$k-2$$$ power). Sorry for bad English expression.

Can someone help me to explain the complexity of problem E plz?

If button $$$i$$$ is pressed, then s>>i will be $$$1$$$. This line is to check whether $$$m$$$ pairs are satisfied.