1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <bits/stdc++.h>

#define pb push_back
#define st first
#define nd second

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

int main()
{
    ios_base::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<ll> v(n);
    for (int i = 0; i < v.size(); ++i) {
        cin >> v[i];
    }

    sort(v.begin(), v.end());

    vector<ll> counts;
    ll start = v[0];
    ll cnt = 1;
    for (int i = 1; i < v.size(); ++i) {
        if (v[i] != start) {
            counts.pb(cnt);
            start = v[i];
            cnt = 1;
        } else cnt++;
    }
    counts.pb(cnt);
    sort(counts.begin(), counts.end());
    for (int i = 1; i <= n; ++i) {
        int result = 0;
        int x = lower_bound(counts.begin(), counts.end(), i) - counts.begin();
        for (int j = x; j < counts.size(); ++j) {
            result += (counts[j] / i) * i;
        }
        cout << result << ' ';
    }
}