Recently i was trying to learn mobius inversion but couldnot find anything in yt (i usually learn from vdos). But i came across a vdo and i pretty much know that he was/is a grandmaster on codeforces. But since i am not from india i am not able to access this free vdo. Can someone out there help me to get this? It will be of great help. I have seen many of his yt vdo to learn things and thats why i am asking for it. Thanks in advance. This is the vdo link: Vdo link

Is it MikeMirzayanov that he is not banned yet? Hey people please stop reporting cheaters. You have live proof before you. No one's gonna do anything. The big fish is still free out there for months, let alone the small fries. Lol.
CF is dying faster than i thought and thanks to the moderators for that. Haha.

So we all are gonna appreciate experts (sonsimpmiku), newbies (countless) and even unrated indian (Arthur_uncle) accounts holding the top of the leaderboard just because they are not caught by System Testing ? I mean they should be banned immediately by common sense. Any sensible person can tell that these are cheaters. Just so funny that they are still at the top lol. I mean just look at sonsimpmiku holding the first rank as if he truly deserves that spot lol. Shameless. They should be banned immediately with a little bit of common sense i should say. I mean who writes this in their code except for LLMs (though idk many may write this but surely this person (hungbui) dont):

 int n, m;
 if (!(cin >> n >> m >> mod)) return 0;

If it was a div 1 or div 1 + div 2 contest then they would have been banned immediately but nobody cares about ratings of div 2 people. Well that's just hilarious. MikeMirzayanov KAN please make a rule of banning or suspending any unrated, newbie, specialist or expert accounts that are on top of every contests. I mean no need to check their code as for sure they are cheaters for obvious reasons. It will surely reduce cheating by many folds. At least we will not see any cheater holding the top ranks. Otherwise codeforces userbase will shrink day by day (as it is getting) and the contests will be among the cheaters :)
HaPPy CoDiNg :D

Today's Div 1 contest's Rank 1 and Rank 2 (VivaciousAubergine and tourist) are of same rating :O

Disclaimer: High-rated coders (1600+), you probably already know all of this so you can ignore this blog — but you’re still welcome to judge my journey or suggest topics :D

Hello everyone. For the past few weeks i was not consistent enough with problem solving. But now i think i should get back to it. And so from now on i am thinking of understanding one topic and solve some good amount of problems of that topic from different platforms. I am planning to keep track of them here so that beginners like me can try to solve them after learning about the topic or algo. I will post the problems that i have solved by myself or have implemented after learning from the editorial. I think keeping track of them here will also encourage me to solve a good amount of problems :D

Dijkstra:
1. Shortest Routes I
2. Flight Discount
3. Flight Routes
4. Investigation
(more to come ...)

I will keep updating this blog whenever I learn a new topic and solve problems related to it.
You too can comment down a problem along with the topic name if you want.

Happy Coding :D

You are given an array of size n. And given Q queries. In each query you will be given a number x. You need to find |a1-x| + |a2-x| + ..... Constraints are : 1<=n,Q<=1e5. Is it possible to solve this in O(n+Q) or within time timelimits?

I don't think anyone who have solved today's H deserves a rating boost for just copying the code from the judge and pasting here. Barely anyone has solved it on their own. you can just see the submissions that almost everyone have just copy pasted the same code. Then why will they get a +ve delta just because they are from a particular region of the world. This is just hilarious. There is no meaning to give points for problem H for those who just copy pasted the code.

I am not affected by it in any way but many of the top rated coders are and it will just be ridiculously funny if they get higher ranks just for copy pasting lol. Dont make codeforces rating that much useless comeon. Don't make it unrated but at least do something instead of giving free points for H (keeping in mind that it had the most points in the round)

Hello good people. The moment we've all been waiting for has finally arrived. Today, for the first time in history, the greatest of all time, tourist , will face off against his rival, conqueror_of_tourist in a blitz round. It’s not just a battle of skill; it's a clash of legacies, a showdown that will determine if the Conqueror can truly live up to his name, or if tourist will add another title to his already legendary status: the Conqueror of Conqueror_of_Tourist. The tension is palpable and the stakes are higher than ever. Who will emerge victorious in this epic faceoff? I am very excited. Stay tuned and buckle up, folks. Fingers crossed as history is about to be made !!!

I am so much loving the fact how some newbies, pupils and specialists are solving in lightning speed with compilation errors and getting their accounts disabled lol. They won't be able to do even one percent of that without AI :)

If you are a cheater feel free to downvote cuz i don't care haha.

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