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
52
53
54
55
56
57
58
/*
 * Author: toko
 * Time: 2024-03-13 00:06:19
 */

#define NDEBUG
#ifdef NDEBUG
#pragma GCC optimize("Ofast,unroll-loops")
#else
#pragma GCC optimize("Og")
#endif

#include <iostream>
#include <unordered_map>
using namespace std;

int main()
{
	iostream::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	size_t n;
	cin >> n;
	unordered_map<int, int> a;
	for (size_t i = 0; i < n; i++)
	{
		int x;
		cin >> x;
		a[x]++;
	}
	unordered_map<int, int> b;
	for (auto e : a)
	{
		b[e.second]++;
	}

	int ans = 1;

	for (size_t i = 1; i <= n; i++)
	{
		if (ans == 0)
		{
			cout << 0 << " ";
			continue;
		}
		ans = 0;
		for (auto e : b)
		{
			ans += (e.first / i) * i * e.second;
		}
		cout << ans << " ";
	}
	cout << endl;


	return 0;
}