Codeforces Round 667 (Div. 3) Stream + All Solutions (A-F) (+ extra)

День тому

Join this discord to find out when more streams will happen (because of school, they're definitely going to be inconsistent): / discord
Contest link: codeforces.com/contest/1409
My submissions: codeforces.com/submissions/ga...
Starting out 00:00
A solving + solution 7:48
B solving + solution 12:32
C solving + solution 20:56
D solving + solution 34:05
E solving + solution 44:49
Becoming very distracted 1:15:03
F solving + solution 1:20:40
Random stuff 1:48:48
Struggling to change channel banner 1:55:11
Re-explaining E 2:04:20
Random stuff 2 (+ chess apparently) 2:19:15

КОМЕНТАРІ: 26

@aaradhyadixit4322 3 роки тому

Loved the way you explained F .. great way of explaining !! Keep doing these streams, these are really great !!! :)

@tudorpagu6369 3 роки тому

Thank you so much!!

@sanzidsadman2265 3 роки тому

keep it up bro

@mlguy8376 Рік тому

Constrained optimization for the second problem - can create a function.

@tradekingdistributing3586 8 місяців тому

Not defending Fox, but Bongino stated many times that Fox wanted him to stay on the network, but he decided to leave to reduce his crazy work schedule. They did offer him a final sign-off show but he declined and opted to explain his move on his podcast and radio show. Tucker obviously WAS fired.

@wonderlustwazaif 6 місяців тому

Awesome!

@suvidsinghal1365 3 роки тому

Didn't mean this by virtual contests 🤦‍♂️🤦‍♂️😂

@high-oncode7576 3 роки тому

I have an image of red coders as just coding faster just after seeing the question.But your so simple guy and even cracking good jokes 😂

@nguyenngocdanh4518 3 роки тому

Setup notepad++ code c++ ?

@ramakantsoni1731 3 роки тому

What can we do if in E question no. Of platforms are also variable ie > 2 .... Thanks in Advance

@ColinGalen 3 роки тому

Letting dp[i][j] be the number of points you can cover placing an interval that ends at position i with j intervals used so far, you can do it in O(nk + nlog(n)) (where k is the number of intervals) with prefix maximums. Not sure if there's a generic O(n) or O(nlog(n)) solution.

@arpitbisht3228 3 роки тому

Can you make a video about how you became so good in such a short time. How long did you use to practice for? What are your learning methods?

@arinroday302 3 роки тому

WTF, stop asking these questions, you can't become good in short time. It takes multiple years. He answered this question before: He learnt from USACO training.

@arpitbisht3228 3 роки тому

@@arinroday302 coming from an unrated guy...

@ColinGalen 3 роки тому

@@arpitbisht3228 I mean, he's right

@arpitbisht3228 3 роки тому

@@ColinGalen are you still in high school?

@ColinGalen 3 роки тому

@@arpitbisht3228 Yes