The Climbing Monkey

CodeChefOpen on judge ↗

A monkey wants to climb a tree, but the problem is that he is not good climber. After climbing N distance, he slips by M distance. So he didn't know how many exact step he needs to climb the tree. Help him to find number of steps required to climb whole tree. Input - The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows. -

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