Codeforces Round #494 (Div. 3) A. Polycarp's Pockets_polycarp has n coins, the value of the i-th coin i-CSDN博客

本文链接：https://blog.csdn.net/c8241998/article/details/80906442

此算法问题探讨了如何将具有不同价值的硬币分配到最少数量的口袋中，确保没有两个相同价值的硬币被放入同一个口袋。通过输入硬币的数量和各自的价值，程序计算并输出所需的最小口袋数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Polycarp has $n$ coins, the value of the $i$ -th coin is $a_{i}$ . Polycarp wants to distribute all the coins between his pockets, but he cannot put two coins with the same value into the same pocket.

For example, if Polycarp has got six coins represented as an array $a = [1, 2, 4, 3, 3, 2]$ , he can distribute the coins into two pockets as follows: $[1, 2, 3], [2, 3, 4]$ .

Polycarp wants to distribute all the coins with the minimum number of used pockets. Help him to do that.

Input

The first line of the input contains one integer $n$ ( $1 \leq n \leq 100$ ) — the number of coins.

The second line of the input contains $n$ integers $a_{1}, a_{2}, \dots, a_{n}$ ( $1 \leq a_{i} \leq 100$ ) — values of coins.

Output

Print only one integer — the minimum number of pockets Polycarp needs to distribute all the coins so no two coins with the same value are put into the same pocket.

Examples
inputCopy
6
1 2 4 3 3 2
outputCopy
2
inputCopy
1
100
outputCopy
1

水题

#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cstdio>
#include <iostream>
using namespace std;

int main() {

	ios::sync_with_stdio(false);
	int count[200]={0};
	int n;
	cin>>n;
	int m[200];
	for(int i=0;i<n;i++){
		cin>>m[i];
		count[m[i]]++;
		
	}
	int max=0;
	for(int i=0;i<200;i++){
		if(count[i]>max) max=count[i];
	}
	cout<<max<<endl;
}