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

using namespace std;

vector<int> solve(int n, const unordered_map<int, int>& cnt1)
{
	unordered_map<int, int> cnt2;

	for (auto const& x : cnt1)
	{
		++cnt2[x.second];
	}

	vector<int> res(n + 1);

	for (auto const& x : cnt2)
	{
		for (int i = 1; i <= x.first; ++i)
		{
			res[i] += (x.first / i) * i * x.second;
		}
	}

	return res;
}

int main()
{
	int n, a;
	cin >> n;

	unordered_map<int, int> cnt1;

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

	vector<int> res = solve(n, cnt1);
	
	for (int i = 1; i <= n; ++i)
	{
		cout << (i == 1 ? "" : " ") << res[i];
	}

	return 0;
}