readme.md (384B)
Searching and Sorting
Distinct Numbers
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 x1, x2, ..., xn. (Example: 5 2 3 2 2 3)
Output: Print one integer: the number of distinct values. (Example: 2)
| ## Searching and Sorting
### Distinct Numbers
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 `x1, x2, ..., xn`. (Example: 5 2 3 2 2 3)
**Output**: Print one integer: the number of distinct values. (Example: 2)
|
