Colourful Array

CodeChefOpen on judge ↗

Jacob and Evie (two Master Assassins of the British Brotherhood of Assassins during the Victorian Era) have an array of $n$ elements. There are $k$ $(n\leq k)$ distinct colours (numbered $1$ to $k$) available to them, out of which they have to choose exactly $n$ colours. Now, they have to colour the array using the $n$ chosen colours (each chosen colour must be used at least once). They want to fi

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