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
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#define st first
#define nd second
typedef long long ll;
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    a.push_back(-1);
    int cnt = 0;
    vector<int> ans(n+1);
    for (int i = 0; i <= n; i++) {
        if (i && a[i] != a[i-1]) {
            for (int j = 1; j <= cnt; j++) {
                ans[j] += cnt/j;
            }
            cnt = 1;
        }
        else cnt++;
    }
    for (int i = 1; i <= n; i++) cout << ans[i] * i << ' ';
    cout << '\n';
}