Code9
CodeChefOpen on judge ↗
Meeta's uncle came to visit her in the summer vaccations they brought a lot of chocolates for her but for each chocolate they asked her to give answer to his question. He would give a number as a string, for which Meeta has to find the number of substrings (or contiguous subsequences) of the given string which recursively add up to 9. Input First line consists of an integer, N denoting the num
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.
Sign in to chat with the tutor and save your progress.
Sign in to start