HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Unsorted > problem:


Distinct Numbers

Section problems

• Stick Lengths
• Traffic Lights
• Concert Tickets
• Finding Borders
• Finding Periods
• Minimal Rotation
• Minimizing Coins
• Missing Coin Sum
• Distinct Numbers
• Dice Combinations
• Collecting Numbers
• Maximum Subarray Sum
• Static Range Sum Queries
• A+B
• B. Влюбленная Duff
• B. Песня о любви
• Goal Parser

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb. Difficulty Alpha

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 .

Output
Print one integers: the number of distinct values.
Constraints
  • 1≤n≤2⋅105
  • 1≤x(i)≤109

Example
Input:
5
2 3 2 2 3
Output:
2

Для отправки решений необходимо выполнить вход.

www.contester.ru