Codeforces Round 807 (Div. 2) Screencast and A-E Solutions

Timestamps:
0:00 Goodmorning
0:25 Solving A
2:24 Solving B
8:47 Solving C
28:50 Solving D
39:00 Solving E
1:04:06 Attempting F
2:15:05 Solutions

[FastCodeDeveloper]

Wow never thought I would see a competitive programmer with a manager. Truly amazing.

[xcx]

Nice solution and approach to E! it makes a lot more sense now. That was really impressive how you came up with the solution in a few minutes. Also, professor koro is the main character in the anime assassination classroom.

[missdraven]

that's what i was waiting for keep it up ^

[jitendrapandey]

Amazing performance our SecondThread 👏👏

[stratonov]

2:14:40 "Insanity is doing the same thing over and over and expecting different results."

[saketshaurya]

I don't understand what he does at 42:12 ... what was he adding 010110111101011 to ?

[Dhru]

which data structure are you using in problem E, seems like segment tree but don't know. It is faster than my lazy segment tree.

[coder_extreme]

Don't worry I will start competing soon.

[tonioreign]

Day 5 of waiting for the LeetCode speed run video. 😂

[cplusplussizeddick]

Why are you using haha (I meant Java, it just autocorrected to that, but "haha" is also an accurate description.

[mdzunayed]

that's cool
can you tell me the name of the IDE! Which one you use now.
thank you

[Rubiks]

which extension shows you the "rating performance" at 2:54:04 ?

[Rubiks]

for B, what if there aren't enough dust to fill all the zero entries. like what if the input was 2 0 0 0 3 0 0 0 0 4 0 6