Jump & Reach

CodeChefOpen on judge ↗

You can only jump from $step-(x)$ to $step-(x+1)$, $step-(x+2)$, or $step-(x+3)$. You have to solve $t$ cases. In each case, you are given an integer $n$. You have to find the number of ways to reach $step-(n)$, starting from $step-(0)$. ###Input: - First line will contain $t$, the number of test-cases. - Next $t$ lines, will contain an integer $n$. ###Output: For each test-case,

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