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

const int N = 3e5 + 5;

int ciag[N];

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

    int n;
    cin >> n;

    for(int i = 1; i <= n; i++)
        cin >> ciag[i];

    sort(ciag + 1, ciag + 1 + n);

    int cnt = 0;

    unordered_map <int, int> ile;

    for(int i = 1; i <= n; i++) {
        if(i != 0 && ciag[i] != ciag[i - 1]) {
            ile[cnt]++;
            cnt = 0;
        }
        cnt++;
    }
    ile[cnt]++;

    for(int i = 1; i <= n; i++) {
        int odp = n;
        for(const auto& [a, x] : ile) {
            odp -= x * (a % i);
        }

        cout << odp << " ";
    }
    cout << "\n";
}