Fall Game(keteki)

CodeChefOpen on judge ↗

Given a 2D grid made of digits (0 to 9). A game character 'Pir' starts at the top of the grid from any cell in the first row of the grid, and goes down the grid. Every time it visits a location in the grid, it increases the points of 'Pir' by the digit in that grid location. 'Pir' can only increase in the x coordinate and can move either in a straight downward path, or diagonally (both left or rig

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