Chocolates and Shivam

CodeChefOpen on judge ↗

Shivam loves chocolates. Akhand, his best friend, will give him chocolates only if he is able to solve a problem. Akhand gave him a string of length N consisting of only 0's and 1's along with two integers K and X. X is also either 0 or 1. He can perform the following operations any number of times (including zero) :- - Select exactly k indexes in the string - For each selected index i ( 1<

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI