A - AB to C

CodeChefOpen on judge ↗

You are given a string consisting only of characters $A$, $B$ or $C$. You can do the following operation as many times as you like : - Choose $1 \le i < j \le |S|$ such that $S_i \ne S_j$. - Delete $S_i$ and $S_j$ - Insert the complementary character of $(S_i, S_j)$ back into the string at **any** position of your choice. The complementary character of $X$ is defined as below : - $X =

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