[BOJ 9913] Max
View as PDF
Submit solution
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text
Points:
1
Time limit:
2.0s
Memory limit:
1G
Problem type
Allowed languages
In a sequence of integers, the number of times an integer occurs is called the frequency of the integer. Given a sequence of integers, find the highest frequency.
입력 형식
The first line contains a single integer N (1 ≤ N ≤ 10000) denoting the number of integers in the sequence. Each of the subsequent N lines contains an integer n (1 ≤ n ≤ 1000) in the sequence.
출력 형식
The output contains an integer that is the highest frequency of the sequence.
예제 입력 1
12
1
2
5
6
3
7
11
345
754
2
5
2
예제 출력 1
3
예제 입력 2
7
2
4
6
7
7
2
4
예제 출력 2
2
Comments