CHEF AND GRID

CodeChefOpen on judge ↗

Chef is planning to visit chefland . In order to reach , He has to travel through a *2D**Grid, initially chef is at **(1,1)** and want to reach **(n,m)** . **(Assume 1-based indexing)** The grid cell contain some stones as hurdle which can be crossed by spending **10** unit of energy per stone. He has initially **‘K’** amount of energy . You have to tell whether chef be able to reach (n,m) or no

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