Blackened Squares

CodeChefOpen on judge ↗

Debmalya and Moumita are playing a game of Matrix Coloring. The game is as follows: A $N$ X $M$ matrix ( following 1 based indexing ) is provided. Every ith row ($1 \leq i \leq N$) is colored black from $n_i$ to $M$th column, and the rest of the positions of that row are colored white. In case all the positions of the ith row are colored white, then $n_i=M+1$. Debmalya's favourite color i

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