Comments

wakanda-forever Can’t we achieve O(n sqrt(n) logn) using Mo’s (maintaining a frequency array and set of numbers not present in current range, shifting l or r should take O(logn), answer in O(1) ) ? And for 10^5 it should be around 5 sec.

0

Resolved.

Why can't anyone in 1900-2099 register for Div.2 this time ?

Can someone submit for practice ?

I can't see it, please tell where to do it

awoo , BledDest , MikeMirzayanov

Even hours after final standings, neither of today,yesterday's contest rating changes are published yet ?

is there any reason or just ratings TLE....

in div2.D1 b.gcd(a,b) divides (a+b) hence b divides (a+b) , => (a+b) = k.b Then a = (k-1).b , this means b divides a

When will selection mails about 2nd round come ? , What is the cutoff score/rank in hackerrank leaderboard ? (Try to send them ASAP,pls)