1003A - Polycarp's Pockets

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 
       
           input 
          
            Copy 
          
6
1 2 4 3 3 2

           output 
          
            Copy 
          
2

           input 
          
            Copy 
          
1
100

           output 
          
            Copy 
          
1

题意：有n枚硬币，每个硬币都有一个价值，你要把他们放进口袋，保证每个口袋的硬币价值不重复，输出最少的口袋数量。

题解：模拟其实就是找里面重复金币的最大个数

c++：

#include<bits/stdc++.h>
using namespace std;
int n,x,a[110],ans;
int main()
{
    cin>>n;
    for(int i=0; i<n; i++)
        cin>>x,a[x]++,ans=max(a[x],ans);
    cout<<ans<<endl;
    return 0;
}

python：

n=int(input())
a=input().split()
ans=[]
for i in a:
    ans.append(a.count(i))
print(max(ans))

还可以这样写：

input()
l = input().split()
print(max(l.count(x) for x in l))

1003A - Polycarp's Pockets

猜你喜欢