TooGoodToLoose's blog

By TooGoodToLoose, history, 13 months ago, In English,

Hello Codeforces Community.

This question is for people who have been doing CP for a lot of time. Given a chance to start all over again, what advice would you give to your former self to improve faster? You can include anything from mistakes you frequently did and improved upon after a long time to topics you procrastinated studying.?

Read more »

 
 
 
 
  • Vote: I like it
  • +84
  • Vote: I do not like it

By TooGoodToLoose, history, 13 months ago, In English,

I am a big fan of rajat1603. However I can see that he has stopped competing on any OJ since the beginning of this year.

Is he taking a break or will he never come back to CP?

Read more »

 
 
 
 
  • Vote: I like it
  • +48
  • Vote: I do not like it

By TooGoodToLoose, history, 13 months ago, In English,

In Mo's Algorithm, we sort the left pointer by using sqrt(N).

However if we consider two left pointers a and b such that a<b then (a/c)<(b/c) where c=sqrt(N). Thus it won't matter if we sort it by a<b or (a/c)<(b/c).

I know I am missing something, but I can't figure it out.

Read more »

 
 
 
 
  • Vote: I like it
  • -11
  • Vote: I do not like it