MINIMUM SUM

CodeChefOpen on judge ↗

You are given a positive integer **num**. Split **num** into two new integers **new1** and **new2** by using the digits found in num. Leading zeros are allowed in **new1** and **new2**, and all the digits found in **num** must be used. - For example, given num = 2932, you have the following digits: two 2's, one 9 and one 3. Some of the possible pairs [new1, new2] are [22, 93], [23, 92], [223, 9]

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