COLORMAP

CodeChefOpen on judge ↗

Chef wants to paint a map of his country. The map contains $N$ number of states. He wants to paint it in such a way that , no two adjacent states are of same color. Help chef find the **minimum** number of colors required to paint the map. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of one line of input.

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