B. Planning The Expedition
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Natasha is planning an expedition to Mars for nn people. One of the important tasks is to provide food for each participant.
The warehouse has mm daily food packages. Each package has some food type aiai.
Each participant must eat exactly one food package each day. Due to extreme loads, each participant must eat the same food type throughout the expedition. Different participants may eat different (or the same) types of food.
Formally, for each participant jj Natasha should select his food type bjbj and each day jj-th participant will eat one food package of type bjbj. The values bjbj for different participants may be different.
What is the maximum possible number of days the expedition can last, following the requirements above?
Input
The first line contains two integers nn and mm (1≤n≤1001≤n≤100, 1≤m≤1001≤m≤100) — the number of the expedition participants and the number of the daily food packages available.
The second line contains sequence of integers a1,a2,…,ama1,a2,…,am (1≤ai≤1001≤ai≤100), where aiai is the type of ii-th food package.
Output
Print the single integer — the number of days the expedition can last. If it is not possible to plan the expedition for even one day, print 0.
Examples
input
Copy
4 10 1 5 2 1 1 1 2 5 7 2
output
Copy
2
input
Copy
100 1 1
output
Copy
0
input
Copy
2 5 5 4 3 2 1
output
Copy
1
input
Copy
3 9 42 42 42 42 42 42 42 42 42
output
Copy
3
Note
In the first example, Natasha can assign type 11 food to the first participant, the same type 11 to the second, type 55 to the third and type 22 to the fourth. In this case, the expedition can last for 22 days, since each participant can get two food packages of his food type (there will be used 44packages of type 11, two packages of type 22 and two packages of type 55).
In the second example, there are 100100 participants and only 11 food package. In this case, the expedition can't last even 11 day.
题意：要为n个人准备食物，现在给了m个食物，每个食物都有一个类型，每个人都只能吃同一类型的食物，求出这些食物可以供n个人吃多少天.
题解：模拟 先把所有同一类型的食数量统计出来，枚举（假设）能够吃多少天，然后把每天所有食物能够供多少人吃算出来，与n比较，大于等于就能够供应，把天数记录下来，直到食物不能够供应n个人或者枚举到m天。
c++：
#include<bits/stdc++.h>
using namespace std;
int n,m,a[110],x,ans,cnt;
int main()
{
cin>>n>>m;
for(int i=0; i<m; i++)
cin>>x,a[x]++;
for(int i=1;i<=m;i++)///假设可以吃i天
{
cnt=0;
for(int j=1;j<=100;j++)///枚举所有食物
cnt+=a[j]/i;///能够供多少人吃
if(cnt>=n) ans=i;
}
cout<<ans<<endl;
return 0;
}python：
n,m=map(int,input().split())
d={};ans=cnt=0
for i in map(int,input().split()):
d[i]=d.get(i,0)+1
for i in range(1,m+1):
cnt=0
for v in d.items():
cnt+=v[1]//i
if cnt>=n: ans=i
print(ans)