Comments

That is not O(n^2). If you see he is terminating the 2nd loop if j*i<=3e5 which reduces the time complexity to O(nlogn).

Bruhhhh This guy posted the same thing again again and again and again

SHITT POST

Damnnnn Is Sashi Tharoor ur dad ???

On Hepic_Antony_SkarlatosIn queue ..., 3 years ago
0

and the problem is back

-43

I fear, one day chatgpt will beat you :|

No wayyy. He did more than 100 submissions in a day.

-20

This contest was easy.

Happy New Year Codeforces

Shit Never really thought about that

B was really frustrating.But one who set those examples did a great job by giving a big value. Otherwise we would have end up getting lots of wrong submissions.

I think the contest is now unrated

Has the ratings rolled back??

+2

Yesterdays contest was good Though I am going to get a negative But it was fun :) :) :) :)

But u gave no contest