ABC Conjecture 2

CodeChefRating 3153Open on judge ↗

*This problem has subtasks.* For a string $S$ containing only the characters `'a'`, `'b'`, and `'c'`, we define $f(S)$ as follows. Consider the following operation: - Choose any [subsequence](https://en.wikipedia.org/wiki/Subsequence) of $S$ that equals $\texttt{abc}$, and delete either the `'a'` or the `'b'` from it. Note that this reduces the length of $S$ by $1$. Formally, choose indices $

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