Sum of all Sub-sequences of a number

CodeChefOpen on judge ↗

Problem description Given a number as string s, find the sum of all the elements present in all possible subsequences of s. Input "123" "453" Output 24 48 Explanation: All possible sub-sequences are 1, 2, 3, {1, 2}, {2, 3}, {1, 3}, {1, 2, 3} which add up to 24

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