Rabbit Jump

CodeChefOpen on judge ↗

Cheeku Rabbit is going to his home.\ \ On the way to his home, there are ‘N’ carrot fields. Consider x-axis as the path to Cheeku’s home.\ \ A carrot field ‘Fi’ on x-axis starts at ‘Li’ and ends at ‘Ri’ both inclusive. Each point on the field contains one carrot of that field.\ \ Cheeku will cover his path to home by jumping. In one jump Cheeku will cover exactly ‘K’ units.\ \ Cheeku will start hi

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