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

int n;
long long int stamps[300000];
long long int res[300001];

void split(int cnt){
    for(int i = 1; i <= cnt; ++i){
        res[i] += cnt - (cnt % i);
    }
}

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

    cin >> n;
    for(int i = 0; i < n; ++i){
        cin >> stamps[i];
    }

    sort(stamps, stamps+n);
    
    //cnt how many stamps are the same
    int cnt = 1;
    for(int i = 1; i < n; ++i){
        if(stamps[i] == stamps[i-1]){
            cnt++;
        }
        else{
            split(cnt);
            cnt = 1;
        }
    }

    split(cnt);

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