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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int>V(n);
    for (int &x : V)
        cin >> x;
    sort(V.begin(), V.end());
    vector<int>K{1};
    for (int i=1; i<n; i++)
        if (V[i]==V[i-1])
            K.back()++;
        else
            K.push_back(1);

    for (int k=1; k<=n; k++) {
        int result = 0;
        for (int i=0; i<(int)K.size(); i++)
            if (k<=K[i])
                result += K[i] / k;
            else {
                swap(K[i], K.back());
                K.pop_back();
                i--;
            }
        cout << result*k << ' ';
    }
    cout << '\n';

    return 0;
}