← All problemsSign in

3 - Domino game

**This is an interactive problem.** Let's consider an $n \times m$ rectangle, where $n$ and $m$ are odd numbers and $n \leq m$. All cells except one special cell are covered with domino rectangles, rectangles of size $1 \times 2$ (possibly vertical or horizontal). This is the picture for the first game from the sample test. Adjacent cells with the same color are in the same domino. The violet

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