Monster Hunting

CodeChefOpen on judge ↗

After a thrilling but exhausting journey of monster hunting, the White Wolf has decided to return to Kaer Morhen. He needs to reach his destination by crossing a $N\times M$ grid that contains at most one monster in each cell. His current location is at cell $(1,1)$ and his destination lies in the cell $(N,M)$. In every step, he is allowed to move $1$ cell to the right or $1$ cell downwards only.

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