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
51
#include<bits/stdc++.h>
using namespace std;
int n,a,nr,count_num;
vector<int> val;
int scale[300007];
int ans[300007];
void input()
{
    cin >> n;
    for(int i=0; i<n; i++)
    {
        cin >> a;
        val.push_back(a);
    }
    val.push_back(1000000001);
    sort(val.begin(),val.end());
    nr=0;
    count_num=0;
    for(int i=0; i<n; i++)
    {
        count_num++;
        if(val[i]!=val[i+1])
        {
            scale[nr]=count_num;
            nr++;
            count_num=0;
        }
    }
}
void solve()
{
    for(int i=0; i<nr; i++)
    {
        for(int j=1; j<=scale[i]; j++)
        {
            ans[j]+=j*(scale[i]/j);
        }
    }
    for(int i=1; i<=n; i++)
    {
        cout << ans[i] << " ";
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    input();
    solve();
    return 0;
}