The master has failed more than the beginner has even tried

If you look at my previous blogs or comments, you will notice that I have a bad(wrong) attitude with pupils and newbies, but I really want to appreciate people, who fight a lot and they never give up, regardless of their rating change. It's true, this is competitive programming, but your main goal shouldn't be being better than someone, you must compete against yourself and don't look at other contestants as your rivals... There are plenty of programmers, who give up when they don't see progress in their rating, but here, in this blog, I want to mention some very determined users. you can also leave in comments somebody, who loves programming as a hobby and not as a sport:

ruban, PAG, eugalt, DatoTS, tantam75, farizazmip Ozymandias, chrome, Azat_Yusupov, Mediocrity, Olympia,

So, you may be stuck on a specific rating, but someday you will start flying. :)

Warning: Before you leave note that This is not my original account, I am not newbie, I am GM irl

I think I solved maximal independent set problem which was called NP hard problem. My Solution works in O(log(n)*n*sqrt(n))) Time and alot of memory.I think I have created some of the new techniques, during solving the problem. Solution is quite big, and it may not be clear, because there is only a code. If you test it, you can see it's correct. I will share my solution in editorial style,after wise peaple test it and confirm that it's true. Otherwise I will fix it. I will never gonna give you up.

Github link

I really hate newbies and pupils. Help me to get rid of them...

Do you want wants new colors and Ranks? I want to ask MikeMirzayanov , will there be third color revolution?

Upvote this blog,If you want new color revolution. like this and this one.

Thanks.

Write your ideas,I would like new colors to be Visible spectrum:

Can somebody help me to solve APIO 2019 problem D? . Also it would be nice if you give me all solutions of APIO 2019,this would be helpful for everyone...

Thanks, in advance !!!

I want to solve TopCoder Div. 1 easy problems,how can I find them? I couldn't find any list of previous contests on Topcoder.