Jumpimg Gopal

CodeChefOpen on judge ↗

Problem statement Gopal is standing at the bottom of a longest stair in UVCE. And surprisingly steps are numbered sequentially form 1 to infinity. The bottommost step has number 1, the next step has number 2, and so on. Gopal is now standing at bottom of the stairs, will now perform exactly N consecutive actions. When performing ith action , Gopal chooses between two options: either he does noth

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