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
#include <bits/stdc++.h>

using namespace std;

int n, tmp;
unordered_map<int, int> counts, counts2;
map<int, vector<int>> residues;

int result[300002] = {0};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n;

    for (int i = 0; i < n; ++i) {
        cin >> tmp;
        if (counts.find(tmp) == counts.end()) {
            counts[tmp] = 0;
        }
        counts[tmp] = counts[tmp] + 1;
    }

    for (auto const& [key, value] : counts) {
        if (counts2.find(value) == counts2.end()) {
            counts2[value] = 0;
        }
        counts2[value] = counts2[value] + 1;
    }

    for (auto const& [key, value] : counts2) {
        for (int i = 1; i <= key; ++i) {
            int tmp = key / i;
            result[i] += tmp * i * value;
        }
    }

    for (int i = 1; i < n; ++i) {
        cout << result[i] << " ";
    }
    cout << result[n];

    return 0;
}