Codeforces C. Pinkie Pie Eats Patty-cakes

Pinkie Pie has bought a bag of patty-cakes with different fillings! But it appeared that not all patty-cakes differ from one another with filling. In other words, the bag contains some patty-cakes with the same filling.

Pinkie Pie eats the patty-cakes one-by-one. She likes having fun so she decided not to simply eat the patty-cakes but to try not to eat the patty-cakes with the same filling way too often. To achieve this she wants the minimum distance between the eaten with the same filling to be the largest possible. Herein Pinkie Pie called the distance between two patty-cakes the number of eaten patty-cakes strictly between them.

Pinkie Pie can eat the patty-cakes in any order. She is impatient about eating all the patty-cakes up so she asks you to help her to count the greatest minimum distance between the eaten patty-cakes with the same filling amongst all possible orders of eating!

Pinkie Pie is going to buy more bags of patty-cakes so she asks you to solve this problem for several bags!

Input
The first line contains a single integer T (1≤T≤100): the number of bags for which you need to solve the problem.

The first line of each bag description contains a single integer n (2≤n≤105): the number of patty-cakes in it. The second line of the bag description contains n integers a1,a2,…,an (1≤ai≤n): the information of patty-cakes’ fillings: same fillings are defined as same integers, different fillings are defined as different integers. It is guaranteed that each bag contains at least two patty-cakes with the same filling.

It is guaranteed that the sum of n over all bags does not exceed 105.

Output
For each bag print in separate line one single integer: the largest minimum distance between the eaten patty-cakes with the same filling amongst all possible orders of eating for that bag.

Example
inputCopy
4
7
1 7 1 6 4 4 6
8
1 1 4 6 4 6 4 7
3
3 3 3
6
2 5 2 3 1 4
outputCopy
3
2
0
4
Note
For the first bag Pinkie Pie can eat the patty-cakes in the following order (by fillings): 1, 6, 4, 7, 1, 6, 4 (in this way, the minimum distance is equal to 3).

For the second bag Pinkie Pie can eat the patty-cakes in the following order (by fillings): 1, 4, 6, 7, 4, 1, 6, 4 (in this way, the minimum distance is equal to 2).

题意：
一些数，有些数相同。求一个排列方式使得相同数的最小距离最大。

只需求出现的最大数量的数，然后将这些数当作隔板

#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 200;
int cnt[MAX];
int main() {
    int t;
    cin>>t;
    while(t--){
        int n;
        scanf("%d",&n);
        for (int i=0;i<=n;++i){
            cnt[i]=0;
        }
        for (int i=0;i<n;++i) {
            int x;
            scanf("%d",&x);
            cnt[x]++;
        }
        int m=0;
        int sum=0;
        for(int i=0;i<=n;++i) 
			m=max(m,cnt[i]); //出现次数最大的数量 
        for (int i=0;i<=n;++i)
			sum+= cnt[i]==m; //这样的数量有几个 
        cout<<(n-sum)/(m-1) - 1<<endl; //对于n个点中，最大的相同的点个数为m，若个数为m的数值点只有一个，则sum取1，安排最后一个点默认放置m个点中的任意一个
										//那么剩余的n-1个点满足剩余的m-1个点的放置，求出间隔。
										//若sum大于1，说明有多个个数为m的数值点，比如有2个，则安排最后两个点放置，之后剩余的n-2个点/m-1  求出间隔 
										//由于最后输出的是两个相同数值的点中间间隔几个数，因此再-1 
    }
    return 0;
}