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
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
typedef pair<int,int> pii;
const ll INFLL=1e18+7;
const int INF=1e9+7;
#define pb push_back
const int MAXN = 3e5+7;
int arr[MAXN];
int tmp[MAXN];
int res[MAXN];
int main()
{
	ios_base::sync_with_stdio(0);
	int n; cin>>n;
    unordered_map<int, int> m;
    for(int i=1;i<=n;++i){
        int x; cin>>x;
        ++m[x];
    }
    for(pii p:m){
        int x = p.second;
        vector<int> divs;
        for(int i=1;i*i<=x;++i){
            divs.pb(i);
        }
        int sqr = (int)sqrt(x);
        for(int i=sqr;i>=1;--i){
            if(i*i != x) divs.pb(x/i);
        }
        int last = 0;
        for(int &v:divs){
            tmp[last+1] += x/v;
            tmp[v+1] -= x/v;
            last = v;
        }
    }
    for(int i=1;i<=n;++i) res[i] = res[i-1]+tmp[i];
    for(int i=1;i<=n;++i) cout<<res[i]*i<<" ";
    cout<<"\n";
}