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
#include <iostream>
#include <vector>
#include <map>
using namespace std;

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int n;
	cin >> n;
	map<int, int>m;
	for (int i = 0; i < n; i++) {
		int a; cin >> a;
		m[a]++;
	}

	vector<int>P(2 * n + 1);

	for (auto p : m)
		P[p.second]++;
	for (int i = 1; i <= 2 * n; i++)
		P[i] += P[i - 1];

	for (int i = 1; i <= n; i++) {
		int res = 0;
		int x = 0;
		while (x * i <= n) {
			res += 1ll * i * x * (P[i * (x + 1) - 1] - P[max(x * i - 1, 0)]);
			x++;
		}
		cout << res << ' ';
	}

	return 0;
}