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
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<set>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<iomanip>

using namespace std;
using ll = long long;
using ull = unsigned long long;

int main()
{
	int n; cin >> n;
	unordered_map<int, int> m;
	vector<int> key(n, 0);
	int index = 1;
	for (int i = 0; i < n; i++)
	{
		int x; cin >> x;
		if (!m[x])
		{
			m[x] = index;
			index++;
		}
		key[m[x] - 1]++;
	}
	vector<int>out;
	sort(key.begin(), key.end());
	index = n - 1;
	for (int i = 1; i<=n; i++)
	{
		int val = 0;
		for (int j = 0; j < n; j++)
		{
			int tmp = (key[j] / i);
			val += tmp*i;
			if (key[j] < i)break;
		}
		cout << val << " ";
	}
}