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
#include <bits/stdc++.h>
using namespace std;
map <int, int> x;
int wsk = 1;
int ile[300007];
unordered_multiset <int> wartosci;
vector <unordered_multiset<int>::iterator> v;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    int a;
    for (int i = 0; i < n; ++i){
        cin >> a;
        if (x[a] != 0){
            ile[x[a]]++;
        }
        else{
            x[a] = wsk;
            ile[wsk]++;
            wsk++;
        }
    }
    for (int i = 0; i <= n; ++i){
        if (ile[i] != 0){
            wartosci.insert(ile[i]);
        }
    }
    long long suma = 0;
    for (long long i = 1; i <= n; ++i){
        suma = 0;
        v.clear();
        for (auto iter = wartosci.begin(); iter != wartosci.end(); ++iter){
            if (((*iter)/i) == 0){
                v.push_back(iter);
                //wartosci.erase(iter);
            }
            else{
                suma += ((*iter)/i);
            }
        }
        for (int j = 0; j < (int)v.size(); ++j){
            wartosci.erase(v[j]);
        }
        suma *= i;
        cout << suma << " ";
    }
}