HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Array and Matrices > problem:


110. 50359 - Mode of a Series

Guest
• Review clarifications (1)

Volume problems

• 51196 - The sum of two arrays
• 51197 - Even and odd Numbers
• Problem 3
• 50468 - Draw Matrix - 2
• 010. 50381 - Sum of the numbers
• 030. 50737 - Sum of the k-largest n...
• 060. 50389 - Reverse an Array
• 100. 50330 - Find the average of n ...
• 110. 50359 - Mode of a Series
• 120. 50331 - Number of Numbers o...
• 120. 50329 - Draw Matrix-1
• 125. 50538 - Sum of kth Diagonal
• 140. 50599 - Sum of Squared Error ...
• 15-SprPrE1-80. 50741 - DNA Distance
• 151. 50557 - nth Power of m (Long...
• 155. 50334 - What is the class aver...
• 155. 50726 - Pascal Triangle - 1

Feedback

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

Time limit 4000/7000/7000/7000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

Mode of a Series

Mode of a series of numbers is the number that occurs the most. For example, the mode of the following series:
    2 3 2 4 5 3 2 1
is 2. With three appearances in the list, it appears the most.

Write a program that is going to read a series of numbers then, it 's going to show the mode of the given series.

Input specification
The first line contains two numbers: the number of numbers (n) and the range of the numbers (m) where 2 ≤ n ≤ 100000 and 1 ≤ m ≤ 1000. The following line contains n space separated numbers where each of the numbers is between 1 and m .

Output specification
Show just one number which appears the most number of times in the series. If there are several numbers having the same (most) number of appearances, then show the smallest number as the mode of this series.

Sample Input:
  10 5
  4 1 1 5 3 2 4 3 3 1

Sample Output:
  1

Output Explanation:

  • 1 appears 3 times
  • 2 appears once
  • 3 appears 3 times
  • 4 appears 2 times
  • 5 appears once

Hence, 1 and 3 have both appeared three times and 1 is smaller; the answer is 1.

 

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

www.contester.ru