Codeforces Round 889 | C1 & C2 Dual Hard Version | Constructive Algorithms

Problem link: codeforces.com...
This video contains an intuitive proof for why the number of operations is always at most 32 but not an exhaustive proof.
I will be pinning a comment to submission and proof after Codeforces system testing is complete.

[@AlgosWithKartik]

AC submission using the described algorithm: codeforces.com/contest/1855/submission/216352418

[@jiteshsingh8689]

I did the same thing for C1 and I was able to prove till 34 operation but didn't think it could work like this so I stopped.

[@jaydeep-p]

The cheaters really ruin the contests for me lol, great video btw I was able to grasp the crux of the solution in the first line of your explanation.

[@zebra-er6xc]

there are literally telegram groups with 5k+ members, but the best part is they don't post more than B solutions

[@nopecharon]

stop complaining!! Just get better than cheaters

[@bilalkhan2298]

Welcome back

[@Now_I_am_all_fired_up]

Bhaiya kaha the

[@swarajbuchude2474]

Also make a video on problem D

[@kaushalkumaryadav4135]

I got stuck at C

[@xiaoshen194]

C1 to kr liya hoga n

[@hkrai1372]

@@xiaoshen194 nope. wo bhi nahi hua.. memory limit exceeded on test 2 🥲🥲🥲🥲

[@zebra-er6xc]

@@xiaoshen194 logic hi samajh nahi aaya tha C ka

[@soumik5854]

Sir how to solve B getting tle

[@AlgosWithKartik]

will try solving if I get time.

[@Pirates571]

Do it with loop i=0 to i

[@ankushkumar11903]

@@Pirates571 Do it with loop i=0 to i

[@Demodulator7]

​@@ankushkumar11903can u give the proof of it that why it works?

[@lakshaybansal2470]

@ankushkumar11903 I guess 20 would work, too ?

[@Epictetus777]

😂😂😂you want to be erichto ??