← All problemsSign in

Name Reduction

CodeChefRating 1404Open on judge ↗

In an attempt to reduce the growing population, Archer was asked to come up with a plan. Archer being as intelligent as he is, came up with the following plan: If $N$ children, with names $C_{1}, C_{2}, ... , C_{N}$, are born to parents with names $A$ and $B$, and you consider $C$ to be the concatenation of all the names of the children, i.e. $C = C_{1} + C_{2} + ... + C_{N}$ (where $+$ is concat

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