Digits Removal

CodeChefOpen on judge ↗

You are given a number $\textbf{N}$ with non-leading zeroes. You can remove as many digits from the number as you want (zero or more), the remaining digits concatenate to form a new number. You are asked the sum of all possible resulting numbers after your move. Note that, it is possible to obtain the same number using a different set of removals, they should be considered different. For example

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