Game Of Hopscotch

CodeChefOpen on judge ↗

A group of friends are playing a game of hopscotch, where they have to hop across N boxes. Find the number of ways in which they can hop across all the boxes if they can hop across only one of two boxes at a time. ### Input Interger N representing number of boxes ### Output Number of ways is the output. ### Constraints N>0 ### Subtasks - 30 points : $1 \leq R \leq 10000$ - 70 points : $1 \leq

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