Chandler and Joey

CodeChefOpen on judge ↗

*“Pizza, we like pizza!”* It’s Joey’s birthday! And guess what? He stumbled across a gift :- a grid $G$ of size $N$ x $M$. Each cell in this grid consists of $G[i][j]$ pizzas. Initially, Joey is standing in the **top-left** corner of the grid eating $G[0][0]$ pizzas. He wants to eat the **maximum** amount of pizzas possible. But there is a catch! Joey is only allowed to move either to

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