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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <bits/stdc++.h>
using namespace std;

void input(int &n, vector <int> &v, unordered_map <int, int> &m){
    cin >> n;

    for(int i = 0; i < n; i++){
        int a;
        cin >> a;

        if(m[a] == 0){
            v.push_back(a);
        }

        m[a]++;
    }

    return;
}

vector <int> get_val(vector <int> &v, unordered_map <int, int> &m){
    vector <int> ans;

    for(int i = 0; i < v.size(); i++){
        ans.push_back(m[v[i]]);
    }

    return ans;
}

void solve(int n, vector <int> &v, unordered_map <int, int> &m){
    vector <int> val = get_val(v, m);

    vector <vector <int>> q (n + 1);

    if(n == 1){
        cout << "1";

        return;
    }

    for(int i = 0; i < val.size(); i++){
        q[2].push_back(i);
    }

    cout << n << " ";

    int wynik = n;

    for(int i = 2; i <= n; i++){
        for(int j = 0; j < q[i].size(); j++){
            int k = q[i][j];

            wynik -= val[k] / (i - 1);

            wynik += val[k] / i;

            int x = val[k] / i;

            if(x != 0){
                 x = (val[k] / x) + 1;

                if(x <= n){
                    q[x].push_back(k);
                }
            }
        }

        cout << wynik * i << " ";
    }

    return;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    vector <int> v;
    unordered_map <int, int> m;

    input(n, v, m);
    solve(n, v, m);

    return 0;
}