Marble Collector

CodeChefRating 860Open on judge ↗

There are a total of $M$ possible types of marbles that you want to collect. They are numbered $1, 2, \ldots, M$. You currently have $N$ marbles with you, with types $A_1, A_2, \ldots, A_N$. Note that you may have the same type of marble twice or more. Find number of types of marbles that you still have not collected. ### Input - The first line of input will contain a single integer $T$, denoti

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