← All problemsSign in

Not Too Colourful

CodeChefRating 2621Open on judge ↗

You have a grid with $N$ rows (numbered $1$ through $N$) and $M$ columns (numbered $1$ through $M$). Initially, the grid is empty. You also have $N \cdot M$ tiles with three colours: $R$ tiles are red, $G$ tiles are green and $B$ tiles are blue. Find a way to place these tiles in the grid such that for each tile, there are at most two distinct colours among the tiles that share a side with it. F

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

Sign in to chat with the tutor and save your progress.

Sign in to start