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
#include <bits/stdc++.h>

using namespace std;

void solve() {
    int n;
    cin >> n;

    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    std::unordered_map<int, int> freqByElem;
    for (const auto &elem : a) {
        freqByElem[elem]++;
    }

    int maxFreq = std::max_element(freqByElem.begin(), freqByElem.end(), [](auto &lhs, auto &rhs) {
        return lhs.second < rhs.second;
    })->second;

    std::vector<int> ans(n + 1);
    ans[1] = n;
    std::unordered_multiset<int> S;
    for (const auto& [elem, freq] : freqByElem) {
        S.insert(freq);
    }

    for (int i = 2; i <= maxFreq; i++) {
        for (auto& freq : S) {
            ans[i] += freq - (freq % i);
        }
        std::vector<int> vec(S.begin(), S.end());
        for (auto& freq : vec) {
            if (freq <= i) {
                S.erase(freq);
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
  
    return 0;
}