Chef and Spice Grid
You have an $N \times M$ grid consisting of $N$ rows numbered $1$ to $N$ from top to bottom and $M$ columns numbered $1$ to $M$ from left to right. Each cell of the grid is initially white. You can perform the following operation any number of times (possibly zero): - Select a row $i$ $(1 \le i \le N)$ and paint all the cells in row $i$ black. - Or select a column $i$ $(1 \le i \le M)$ and paint
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.
Sign in to chat with the tutor and save your progress.
Sign in to start