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

int n;
const int MAXN = 3e5 + 7;
map<int, int> cnt;
int pref[MAXN];
int ans[MAXN];

void solve(){
    ans[1] = n;
    for(int i = 2; i <= n; i++){
        int akt = i;
        ans[i] = 0;
        while(akt <= n){
            ans[i] += (akt * (pref[min(n, akt + i - 1)] - pref[akt - 1]));
            akt += i;
        }
    }
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    
    cin >> n;
    for(int i = 1; i <= n; i++){
        int x;
        cin >> x;
        cnt[x]++;
    }
    
    for(auto ele : cnt){
        pref[ele.second]++;
    }
    
    for(int i = 1; i < MAXN; i++){
        pref[i] = pref[i] + pref[i - 1];
    }
    
    solve();
    for(int i = 1; i <= n; i++){
        cout << ans[i] << ' ';
    }
    cout << '\n';
    
    return 0;
}