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

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n;
    cin>>n;
    vector<int> v(n);
    for (int i = 0; i < n; i++){
        cin>>v[i];
    }
    sort(v.begin(), v.end());
    vector<int> pom;
    int x = 1;
    for (int i = 1; i < v.size(); i++){
        if (v[i] != v[i-1]){
            pom.push_back(x);
            x = 0;
        }
        x++;
    }
    pom.push_back(x);
    sort(pom.begin(), pom.end());
    vector<pair<int,int>> t;
    x = 1;
    for (int i = 1; i < pom.size(); i++){
        if (pom[i] != pom[i-1]){
            t.push_back({pom[i-1], x});
            x = 0;
        }
        x++;
    }
    t.push_back({pom.back(), x});
    int wyn = 0;
    int wsk = 0;
    for (int i = 1; i <= n; i++){
        wyn = 0;
        for (int j = wsk; j < t.size(); j++){
            wyn += (t[j].first/i)*i*t[j].second;
        }
        cout<<wyn<<" ";
    }
    cout<<"\n";
}