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

map<int, int> cities;
int geq[300007];


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

    int n;
    cin >> n;

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

    vector<int> cnt;
    for (auto p: cities) {
        cnt.push_back(p.second);
    }

    sort(cnt.begin(), cnt.end());
    
    int last = (int)(cnt.size()) - 1;
    for (int i = n; i >= 1; i--) {
        while (last >= 0 && cnt[last] >= i) {
            last--;
        }
        // last to pozycja pierwszego < i
        geq[i] = (int)(cnt.size()) - 1 - last;
    }

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

    for (int k = 1; k <= n; k++) {
        int ans = 0;
        for (int j = k; j <= n; j += k) {
            ans += geq[j];
        }
        ans *= k;
        cout << ans << " ";
    }
    cout << "\n";
    
}