A Common Problem

CodeChefOpen on judge ↗

Nidhi takes out his Snakes and Ladders game, stares at the board and wonders: "If I can always roll the die to whatever number I want, what would be the least number of rolls to reach the destination?" Rules The game is played with a cubic die of $6$ faces numbered $1$ to $6$. - Starting from square $1$, land on square $100$ with the exact roll of the die. If moving the number rolled would pl

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