Scinist Issue

CodeChefOpen on judge ↗

One Day, $Jethalal$ decided to gift $Babita Ji$, a pack of CHOCO MOCO CHOCOLATE, but scientist $Iyer$ had some other plans. He decided to stop him by creating a problem which $Jethalal$ has to solve in order to meet $Babita Ji$. $Iyer$ gave $Jethalal$ a N X M board, in which every cell is marked as 1. Now $Jethalal$ has to design a move for every cell (i , j). A move can be: 1. L - Moving Lef

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