← All problemsSign in

Make Bob Win

CodeChefRating 1450Open on judge ↗

Alice and Bob are playing a game. They have with them a binary string $S$. Alice and Bob alternate making moves, with Alice going first. On their turn, a player does the following: - Choose a non-empty contiguous [substring](https://en.wikipedia.org/wiki/Substring) of $S$ all of whose characters are the same, delete it from $S$, and concatenate the remaining parts. - More formally, choose i

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

Sign in to chat with the tutor and save your progress.

Sign in to start