Problem 7

CodeChefOpen on judge ↗

You are given a number with n digits . Your task is to split up the number into two digits such that none of them has leading zeroes and then add the two numbers obtained by spliting the original number . Find the minimum value of such a number among all possible splits . ### Input - First line will contain the number of testcases $T$. - First line will contain $n$, number of digits in the numb

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