Hi CodeForces, Currently I am studying Randomised algorithms for my Theoretical Computer science course. Our professor mentioned that there used to be many problems prior which had a randomised solution in polynomial time but not a known deterministic solution in polynomial time, but there aren’t that many problems of this type left now.

I wanted to know are there any Competitive programming problems which have a randomised algorithm solution and have a much worse deterministic solution in terms of time complexity or implementation.

Note our course mostly focuses on the theoretical aspects, so it would gave me a better intuition about randomised algorithms if I am able to do such a problem.

Hello CF,

I just want an advice on how to handle big contests after my choke in INOI. Like I went from 54 nationally in first stage to 158 in second(INOI). Any tips would be valuable for me.

Thanks for reading for blog !

Hello everyone, I am newbie on codeforces. I started cp around 2 months back. I was able to solve a, b, c of the recent div3 contest. The problem is for some reason I have never solved more than a in any div2. Any advice for practice you all would suggest. And which level of problems should I target for zco and inoi (India’s national oi).