Counting Ways

CodeChefOpen on judge ↗

Rancho and his friends have decided to climb the tower again, but this time something different happened. Raju said the he can climb upto two stairs at a time. This means if Raju is standing at $i^{th}$ stair then he can go to $(i+1)^{th}$ or $(i+2)^{th}$ stair in a single turn. They started wondering in how many ways Raju could reach the $Nth$ stair. Farhan said that it is impossible to calculate

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