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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#if DEBUG
#define LOG(...) printf(__VA_ARGS__)
#define DOUT cout
#else
#define LOG(...)
#define DOUT if(0) cout
#endif

int main() {
    int n;
    scanf("%d", &n);
    unordered_map<int, int> m;
    for (int i = 0; i < n; i++) {
        int in;
        scanf("%d", &in);
        m[in]++;
    }
    for (auto [k, v] : m)
        LOG("%d: %d\n", k, v);
    vector<int> values;
    values.reserve(m.size());
    for (auto [k, v] : m)
        values.push_back(v);
    sort(values.begin(), values.end(), std::greater());

    int last_result = -1;
    for (int d = 1; d <= n; d++) {
        if (last_result == 0) {
            printf("0 ");
        } else {
            int result = 0;
            // for (auto &[k, v] : m) {
            //     result += v / d;
            // }
            for (int v : values) {
                if (v / d == 0)
                    break;
                result += v / d;
            }
            
            result *= d;
            printf("%d ", result);
            last_result = result;
        }
    }
    printf("\n");
}