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

const int n_max = 3 * 1e5 + 7;
int ans[n_max];

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> diffrent_number;
    map<int, int> sum_num;
    for(int i = 0; i < n; i++){
        int a;
        cin >> a;
        if(sum_num.find(a) == sum_num.end()){
            sum_num[a] = 1;
            diffrent_number.push_back(a);
        }else{
            sum_num[a]++;
        }
    }
    for(auto a: diffrent_number){
        int k = sum_num[a];
        for(int i = 1; i <= k; i++){
            ans[i] += k - k%i;
        }
    }
    for(int i = 1; i <= n; i++){
        cout << ans[i] << ' ';
    }





    return 0;
}