HI good people. Recently i learned about mo's algorithm and grabbed some basic idea of SQRT decomposition. I solved a few problems related to it but those were just direct implementation. So i would I like to know from you if you found some problems that you solved using anyone of these two topics. It will be helpful if you provide me the link to those problems in the comment that you think are related to these topics. (also if the problems are more recent it will be more appreciated. Thank you)

N.B. Also this is just for learning purpose. I know these topics are very tough for someone at this level but i want to give them a try out of interest you can say :D

Hello everyone. I want to touch the blue color within the 31st of may. If anyone wanna join this race with me you're welcome.

I am very annoyed by the fact that no matter how much I try I can't even cross the pupil barrier.. Now everyday or in every two days I am going to past here the problems I am solving.. If I don't slv any problem I can update the post.. Maybe this will help me in pushing myself everyday..any newbie or pupil or even higher rated coder can do the same or slv the porblems I am posting here.. I will slv it no matter what if I can't then watch the edi and slv somehow but will solve everyday for sure.. I think I will start doing cses again first.. Hope for the best..

N.B. I am not bluffing I am pretty much serious about it so pls dont write anything hateful that will demotivate me. Thanks :D