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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i <= (r); ++i)
#define REP(i, n) FOR(i, 0, (n) - 1)
#define rep(i, a, b) for(int i = a; i < (b); ++i)

#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define ssize(x) int(x.size())

#define int long long
#define pb push_back
#define fi first
#define se second
#define ld long double

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair <ld, ld> pd;

using LL=long long;

#ifdef DEBUG
auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "()" << p.first << ", " << p.second <<")";
}
auto operator<<(auto &o, auto x)-> decltype(x.end(), o) {
    o << "{";int i = 0;
    for(auto e : x) o << ", "+!i++<<e;
    return o <<"}";
}
#define debug(x...) cerr << "["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(x)
#else
#define debug(...) {}
#endif

void solve() {
    int N;
    cin >> N;
    
    vector<int> a(N), ans(N);
    set<int> different;

    REP(i, N) {
        cin >> a[i];
        different.insert(a[i]);
    }

    int K = different.size();
    vector<int> cities(all(different));
    
    vector<int> counter(K);

    for (auto i : a) {
        auto position = lower_bound(all(cities), i) - cities.begin(); 
        counter[position]++;
    }

    debug(cities);

    sort(all(counter));
    debug(counter);

    for (int i = 1; i <= N; i++) {
        auto start = lower_bound(all(counter), i) - counter.begin();
        for (int j = start; j < K; j++) {
            ans[i-1] += (counter[j] / i) * i;
        }
    }

    for (auto i : ans) {
        cout << i << ' ' ;
    }
    cout << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);

    int t = 1;
    // cin >> t;
    while(t--) {
        solve();
    }
}