Ross goes for Shopping

CodeChefRating 2396Open on judge ↗

The Big Billion day has arrived and Ross has $N$ items in his mind which he wants to purchase. After purchasing Ross found that he has total of $M$ type items from 1 to $M$. Now to distinguish the items from each other he wants to arrange them in such a way that items of same type occur continuously. For this he can select any $K$ ( $0$ <= $K$ <= $N$ ) number of items and permute them

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