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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <bits/stdc++.h>

using namespace std;

template<typename T>
using pair2 = pair<T, T>;

#define int long long
#define pii pair<int,int>
#define pb push_back
#define pf push_front
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define endl "\n"
#define in(x) cin >> x
#define ini(x) int x; in(x)
#define instr(x) string x; in(x)

#define inf 1e18

//https://codeforces.com/blog/entry/62393
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    ini(n);
    unordered_map<int,int,custom_hash> m;
    for (int i = 0; i < n; i++) {
        ini(a);
        m[a]++;
    }

    // m2 ma maksymalnie O(sqrt(n)) elementów, gdyż suma wszystkich elementów drugich w m wynosi n
    unordered_map<int,int,custom_hash> m2;
    for (auto i : m) {
        m2[i.second]++;
    }

    vector<pii> vec;
    for (auto i : m2) {
        vec.pb(i);
    }

    sort(all(vec),greater<pii>());

    for (int k = 1; k <= n; k++) {
        int res = 0;
        for (auto i : vec) {
            if (i.first < k) break;
            int c_i = i.first / k * k;
            res += c_i * i.second;
        }
        cout << res << " ";
    }
    cout << endl;
}