Codeforces 1011B - Planning The Expedition
Natasha is planning an expedition to Mars for n people. One of the important tasks is to provide food for each participant.
The warehouse has m daily food packages. Each package has some food type ai.
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 j Natasha should select his food type bj and each day j-th participant will eat one food package of type bj. The values bj 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 n and m (1≤n≤100, 1≤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,…,am(1≤ai≤100), where ai is the type of i-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.
範例:
input:
1 | 4 10 |
output:
1 | 2 |
input:
1 | 100 1 |
output:
1 | 0 |
input:
1 | 2 5 |
output:
1 | 1 |
input:
1 | 3 9 |
output:
1 | 3 |
Note:
In the first example, Natasha can assign type 1 food to the first participant, the same type 1 to the second, type 5 to the third and type 2 to the fourth. In this case, the expedition can last for 2 days, since each participant can get two food packages of his food type (there will be used 4 packages of type 1, two packages of type 2 and two packages of type 5).
In the second example, there are 100 participants and only 1 food package. In this case, the expedition can’t last even 1 day.
題意:
輸入N個人跟M包食物，再輸入這M包食物的種類。現在規定每個人指定一種食物，每天只能吃一樣種類的食物，沒有每個人都要指定一樣或不一樣的種類，問你這些食物最多能吃幾天？
思路:
用二分搜尋法搜尋天數d，判斷食物夠不夠吃d天。先統計食物的出現次數，出現次數除以天數就等於能給幾個人吃d天，加總所有食物能供給的人數，若是大於等於N就表示這些食物可以吃d天。