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;


vector <int> solve(int n, vector <int> &a) {
    map <int,int> cnt;
    for (int ai : a) {
        cnt[ai]++;
    }

    map <int,int> numWithCnt;
    for (auto &e : cnt) {
        numWithCnt[e.second]++;
    }

    vector <pair<int,int>> numWithCntVec(numWithCnt.begin(), numWithCnt.end());

    vector <int> ans(n);
    for (int k = 1; k <= n; k++) {
        int numMissing = 0;
        for (auto &e : numWithCntVec) {
            numMissing += e.second * (e.first % k);
        }

        ans[k - 1] = n - numMissing;
    }

    return ans;
}

int main() {
    ios_base::sync_with_stdio(false);

    int n;
    cin >> n;

    vector <int> a(n);
    for (int &ai : a) {
        cin >> ai;
    }

    auto ans = solve(n, a);
    for (int x : ans) {
        cout << x << ' ';
    }

    return 0;
}