Computer Language

CodeChefOpen on judge ↗

Tanmay wants to create a new computer language. For his language he has to come up with $n$ alphabets. Each alphabet is a sequence of "$0$" and "$1$" such that no alphabet’s sequence is a prefix of another alphabet's sequence. "$0$" and "$1$" costs $a0$ and $a1$ rupees respectively. Find the minimum cost to create $n$ alphabets using the above conditions and print this cost. ###Input: - Firs

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