7501: [CSES Problem Set] Distinct Numbers
[Creator : ]
Description
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,…,x_n$.
The second line has $n$ integers $x_1,x_2,…,x_n$.
Output
Print one integers: the number of distinct values.
Constraints
$1 \leq n \leq 2 \times 10^5$
$1 \leq x_i \leq 10^9$
$1 \leq x_i \leq 10^9$
Sample 1 Input
5
2 3 2 2 3
Sample 1 Output
2
一共 $2$ 个不同的数字，数据为 $2,3$。
Sample 2 Input
5
3 3 3 3 3
Sample 2 Output
1