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

using namespace std;

const int N = 1000 * 1000 + 10;

int s_pref[N];
int occ[N];

int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);    
    
    int n;
    cin >> n;
    vector<int> numbers(n, 0);
    for (int i = 0; i < n; i++)
        cin >> numbers[i];
        
    sort(numbers.begin(), numbers.end());
    for (int i = 0; i < (int)numbers.size(); i++) {
        int j = i;
        while (j < (int)numbers.size() && numbers[i] == numbers[j])
            j++;
        occ[j - i]++;
        i = j - 1;        
    }
    for (int i = 1; i < N; i++)
        s_pref[i] = s_pref[i - 1] + occ[i];
        
    vector<int> res(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        for (int j = i; j <= n; j += i) {
            res[i] += j * (s_pref[j + i - 1] - s_pref[j - 1]);
        }
    }
    for (int i = 1; i <= n; i++)
        cout << res[i] << " ";
    cout << "\n";
    return 0;
}