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
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <ctime>
#include <cmath>
#include <chrono>
#include <map>
#include <assert.h>
#include <fstream>
#include <cstdlib>
#include <random>
#include <iomanip>
#include <queue>
#include <random>
#include <unordered_map>
 
using namespace std;

#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()

const int MOD = (int) 1e9 + 7;

void solve() {
    int n;
    cin >> n;

    map<int, int> q;
    for (int i = 0; i < n; ++i) {
        int a;
        cin >> a;

        ++q[a];
    }

    vector<int> dp(n + 1);
    for (auto i : q) {
        for (int j = 1; j <= i.second; ++j) {
            dp[j] += i.second / j * j;
            dp[j + 1] -= i.second / j * j;
        }
    }

    int ans = 0;
    for (int i = 1; i <= n; ++i) {
        ans += dp[i];

        cout << ans << " ";
    }
    cout << "\n";
}

int main() {
    // freopen("input.txt", "r", stdin);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int tests = 1;
    // cin >> tests;

    for (int i = 0; i < tests; ++i) {
        solve();
    }
}