Codeforces CodeTON Round 9 Animated Video Editorial [A-D]

[@sazid1183]

Really loved your work, bruh! especially the animation!!!

[@danieldiaz855]

Thank you for the effort, this is really a high quality tutorial!

[@pawn2pawn]

For problem C1, the answer exists only when the most significant bit of both x and y is a set bit. So instead of running the loop from y = 1, we can run from y = 2 ^ (log2(x)).

[@andreaskonstantinou008]

Wow. This is the best quality video discussing cf solutions I have ever seen.

[@ketansuman5732]

appreciate your hardwork brother

[@abhinavennala9613]

Thanks for the editorial

[@sababmuhammad4842]

excellent video & explanation

[@freebookstore3242]

is good explanation

[@SaiDharahasReddyIndrakanti]

in the second question are we solving it by looking only for distinct character substring ? is it because if the substring length is made odd with unique charcaters we can have even no of distinct substrings

[@BoraDemirtas]

Yeah if we have 3 unique characters next to each other, f(p) will will be even. Take the string abc the substrings will be "a", "b", "c", "ab", "bc", "abc". That is 6 in total. The other case is when two same characters are next to each other. Take the string "aa" the two substrings are "a" and "aa".

[@namanmishra6204]

can you suggest a learning source to make videos like this?

[@BoraDemirtas]

www.manim.community/ is good to get started

[@nullchilly]

Borz

[@BoraDemirtas]

WOW!!!

[@aankie]

sorry i dont want to hurt, its so difficult for me to grasp your accent