← All problemsSign in

Distinct Numbers

CSESSorting and SearchingOpen 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 integers x_1,x_2,\dots,x_n. Output Print one integers: the number of distinct values. Constraints - 1 \le n \le 2 \cdot 10^5 - 1 \le x_i \le 10^9 Example Input: 5 2 3 2 2 3 Output: 2

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

Sign in to chat with the tutor and save your progress.

Sign in to start