KingTour

CodeChefOpen on judge ↗

King Lanuk is the ruler of a vast kingdom which spans an M x M grid(each point on the grid is a city) which has an invisible electric fence around it. So if anybody by mistake crosses over the boundary, he dies. King Lunak decides to send his messengers on a N day quest. Each messenger starts from the capital of the city which is a cell given by X, Y (1-indexed). On each day, the messenger can mo

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