A - ABC Stamp

CodeChefOpen on judge ↗

There is a string $S$ of length $N$. Initially, $S_i$ is $\text{?}$ for all $i$. You can perform the following operation any number of times. - Select an index $i$ such that $1 \le i \le N - 2$, and change the following three characters: - $S_i := \text{A}$ - $S_{i+1} := \text{B}$ - $S_{i+2} := \text{C}$ You are given a target string $R$ of length $N$, consisting of letters $\text{A},\

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