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
#include <bits/stdc++.h>
using namespace std;
unordered_map<int, int> mp;
vector<int> dane;
int tab[300009];
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        mp[x]++;
    }
    int c = 0;
    for(auto x: mp) {
        dane.push_back(x.second);
        c++;
    }
    sort(dane.begin(), dane.end());
    for(int i = 1; i<=n; i++) {
        auto q = lower_bound(dane.begin(), dane.end(), i);
        int index = q - dane.begin();
        tab[i] = c-index;
    }
    cout << n << " ";
    for(int i = 2; i<=n; i++) {
        int suma = 0;
        for(int j = i; j<=n; j+=i) {
            suma += tab[j];
        }
        cout << suma * i << " ";
    }
    return 0;
}