Staircase
CodeChefOpen on judge ↗
A child runs up a staircase with ‘n’ steps and can hop either 1 step, 2 steps or 3 steps at a time. Find all possible ways in which the child can run up the stairs. ### Input -The first line of input consists of a single integer T, denoting the number of test cases. -The first line of each test case consists of an integer n, denoting the total number of steps. ### Output -For each test case, pr
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