Distinct Values

CodeChefOpen on judge ↗

You are given a list of $N$ integers, and your task is to calculate the number of **distinct values** in the list. ### Input - The first input line has an integer $N$ : the number of values. - The second line has $N$ space-separated integers x1,x2,…,xn. ### Output Print one integers: the number of distinct values. ### Constraints - $1 \leq N \leq 10^5$ - $1 \leq xi \leq 10^9$ ### Subtasks - **

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