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
#include <bits/stdc++.h>
using namespace std;
#define rep(a, b) for (int a = 0; a < (b); a++)
#define rep1(a, b) for (int a = 1; a <= (b); a++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;

#define LOCAL false

const int MAX_N = 3e5 + 7;
int n;

map<int, int> valcnt;
int cntnum[MAX_N];
int sumpref[MAX_N];
int sumrange(int l, int r) {
    if (l == 0) return sumpref[r];
    return sumpref[r]-sumpref[l-1];
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (LOCAL) {
        ignore=freopen("io/in", "r", stdin);
        ignore=freopen("io/out", "w", stdout);
    }

    cin >> n;
    int val;
    rep(i, n) {
        cin >> val;
        valcnt[val]++;
    }
    for (auto [val, cnt]: valcnt) cntnum[cnt]++;
    rep1(i, n) sumpref[i] = sumpref[i-1] + cntnum[i];


    rep1(s, n) {
        int ans = 0;
        for (int i = 0; i*s <= n; i++) {
            int l = i*s;
            int r = l+s-1;
            ans += sumrange(l, min(n, r))*i*s;
        }
        cout << ans << ' ';
    }
    cout << '\n';

    return 0;
}