HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Algorithms and Data Structures > problem:


30. Distinct Numbers

Volume problems

• 22. Creating Strings
• 23. Apple Division
• 24. Coin Piles
• 25. Josephus Queries
• 26. Exponentiation
• 27. Dice Combinations
• 28. Minimizing Coins
• 29. Coin Combinations I
• 30. Distinct Numbers
• 31. Apartments
• 32. Ferris Wheel
• 33. Concert Tickets
• 34. Maximum Subarray Sum
• 35. Stick Lengths
• 36. Missing Coin Sum
• 37. Collecting Numbers
• 38. Playlist

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