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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1000 * 1000 + 7;
int tab[N], il[N];

void Solve()
{
    int n, cur = 1;
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> tab[i];
    sort(tab + 1, tab + 1 + n);
    for(int i = 1; i <= n; ++i)
    {
        if(i == n || tab[i] != tab[i + 1])
        {
            ++il[i - cur + 1];
            cur = i + 1;
        }
    }
    for(int i = 1; i <= n; ++i)
        il[i] += il[i - 1];
    for(int i = 1; i <= n; ++i)
    {
        int ans = 0;
        for(int j = i; j <= n; j += i) ans += (il[min(n, i + j - 1)] - il[j - 1]) * j;
        cout << ans << " ";
    }
    cout << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}