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
#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;
using ll = long long;

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

	int n;
	cin >> n;
	vector<int> z(n), cnt;
	for (auto &i : z)
		cin >> i;

	sort(z.begin(), z.end());

	// cnt[i] = number of elements eaual to ith smallest element in z
	cnt.push_back(1);
	for (int i = 1; i < n; i++) {
		if (z[i] == z[i - 1])
			cnt.back()++;
		else
			cnt.push_back(1);
	}

	vector<ll> res(n + 1, 0);

	for (auto i : cnt) {
		for (int j = 1; j <= i; j++)
			res[j] += i - (i % j);
	}

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