Tile Jump

CodeChefOpen on judge ↗

Problem description. Agnes, Gru's youngest daughter, has learnt to jump. She can jump one, two or three steps at a time. In order to keep her busy, Gru has created a linear array of N tiles with each tile being marked from 1 to N. Each tile is equivalent to one step that Agnes can jump. Agnes is standing before the first tile. And she jumps only in the positive direction. That is, if she is at

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