Mussadi lal and stairs

CodeChefOpen on judge ↗

Mussadi lal wants to climb a series of stairs. There are n stairs in total, Mussadi can either climb 1, 2 or 3 stairs in a single move. In how many ways can Mussadi lal reach the last stair i.e. the nth stair. INPUT The first line of the input contains an integer t, the number of test cases. Then t test descriptions follow. Each test consists of a single number n denoting the number of stairs Mu

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