Functions

CodeChefOpen on judge ↗

Mahi was using stairs to reach to the location. Number of stairs given is n, he can jump one or two stairs at a time. so now your task is to find total ways in which he can complete climbing n stair ### Input The first line number of stairs n. ### Output Output is total ways in which he can complete climbing n stair ### Constraints 1<=n<=50 ### Subtasks - 30 points : $1 \leq R \leq 10000$ - 70

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