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
#include<bits/stdc++.h>
#define MAXN 500311

using namespace std;

int n, c;
int tab[MAXN];
int p[MAXN];
vector<int> v;

int main() {
	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> tab[i];
	}
	sort(tab, tab + n);
	
	c = 1;
	for (int i = 1; i < n; i++) {
		if (tab[i] == tab[i - 1]) {
			c++;
		} else {
			v.push_back(c);
			c = 1;
		}
	}
	v.push_back(c);
	
	for (int i = 0; i < v.size(); i++) {
		for (int j = 1; j <= v[i]; j++) {
			p[j] += v[i] / j;
		}
	}
	
	for (int i = 1; i <= n; i++) {
		cout<<p[i] * i<<" ";
	}
	cout<<"\n";
	
	return 0;
}