Before last contest that I coded, I had 1670, than I lost 77 points of my rate and before last contest I was a cyan. Than, my friend noticed me, that 21.11 would be a div2 contest! I thought and I solved a problem of the humanity — if I wouldn't write a contest div2, I will increase more rate on div3!!! How simple and geniously it is. I know, that this kind of trick many of CF users know, but... the key is in the practice this trick.

So, will watch what I will have after div3:)

C1-C2 (div2) The shittiest problem of the November 2020 on CF

In today's blog I want to check how many CF's friends do I have.

The challenge is that I need to write a stupid blog with no meaning and my friends in CF's will write in comments something clever. I know, that's stupid, but... let's check!

P.S. Add me to friends 0_0_)

P.P.S keku

Just ask me some questions if u wanna to

You know, problems from this Div2 were nice, I solved ABC in first hour, but... yeah... UNRATED!!!

Testers: Devil, Dragnoid99, NOOBxCODER, NooB_MB, Osama_Alkhodairy, Prabowo, Taran_1407, Tarrus, Tathagat_shah, TheOneYouWant, Utkarsh.25dec, Vivek1998299, Aaryan, aryanc403, dorijanlendvaj, growup974, hugopm, kshitij_sodani, ltc.groverkss, nishkarsh, rohamizadidoost, shash42, socho, talibmohd, thenymphsofdelphi, Monogon, Ari, 300iq, AmShZ, errorgorn, tejas10p, --Someone--, pyNS, aujasvit_datta, TeaTime, bhaskarjoshi2001, manikjain4, namanbansal013, Gur27, and DarkCraftPlayz

What did you do in testing?)))

So good problems, the idea of them is better then in other medium div2.... but... you SUCKED!

This post is toxic a little, you might think, but...

U can watch in my blog another article, that MikeMirzayanov isn't toxic!

Hi guys!

I encountered with a big problem. After Technocup (2/3 days later) contest I wanted to see the tags and complexity of problems that I've solved but... There was only E from Div1 based on Technocup 2021 Elimination Round 1.

I was confused, there were no problems in problemset from Technocup and Div. 1/ Div 2, based on Technocup 2021 Elimination Round 1!

Then, I went through the direct link of problems that I've solve and you know... In this links there were tags and complexity in all problems of Technocup and all contests that are based on it!

So, if you're lazy, I watched on all difficulties of problems and here are they:

A — B — C / A div1 — D / B div1 — E / C div1 — D div1 — E div1

• 800 — 1100 — 1900 — 1700 — 2100 — 2800 — 3500

MikeMirzayanov Why there're no problems in problemset from Technocup and Div. 1/ Div 2, based on Technocup 2021 Elimination Round 1? Please, fix it)

You know, I was very glad, when MikeMirzayanov answer me in Telegram.

This was 10 days ago, and CF was laying on the floor) I write to Mike:

" Hello, I'm Vladimir Putinov,

I want to code in Codeforces, when it will open? I want to learn!

"

And he answered — "I hope tomorrow. Hello."

That was very surprising for me! You know, I have seen Cristiano Ronaldo in my life in 2 meters, but an answer from Mike to Vladimir Putinov was more better than a meeting with Ronaldo!!

My conclusion:

Mike is not TOXIC!!!!!

Why do you think that there are so many memcreators?

Most of memes are downvoted, cause people are tired of IT memes from contest to contest.

I can't even imagine, why... why!! So, being honest, I did memes too, but I created my own meme, no plagiat.

Where is logic to hype from not yours meme? Maybe you know, maybe you can answer where is logic of this group of people!

I have come up with (invent) a new list hashing algorithm that you can use to hash lists whenever you want. The secret is simple:

Suppose B is a dict (map) ar = list (vector)

Then for a list consisting of two elements, we need to match this number:

B[pow(ar[0], 37, 1000000007) + pow(ar[1], 43, 1000000007)] = [ar[0], ar[1]]

So we have mapped a list of 2 elements to a number!!!

The more items in the list, the further we can add pow(ar[i], P_i, 1000000007), where i is the trace. index in the list (vector), and P_i is the trace. Prime number.

With this hashing of lists (vectors), we can with a probability of 95-99% drive the problem to OK without much bother!!!

I hope the article was useful!