Bunny Wants To Go Home

CodeChefOpen on judge ↗

Bunny lives a wonderland, which is in shape of a n*m grid. He also loves travelling a lot. He is currently eating carrots at cell $(x1,y1)$ and wants to go home at cell $(x2,y2)$, Going to a cell costs him the carrots written on that cell. He can only travel to the adjacent cell from where he is standing. Find the minimum carrots bunny need to go to his home. (Bunny can travel to last cell of a

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