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

using namespace std;

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

	int n;
	cin >> n;
    unordered_map<int, int> counts;
	for (int i = 0; i < n; i++) {
		int tmp;
		cin >> tmp;
		counts[tmp]++;
	}
	
	vector<int> counted;
	for (auto &[key, value] : counts)
		counted.push_back(value);

	sort(counted.begin(), counted.end(), greater<int>());

	cout << n << ' ';
	for (int i = 2; i <= n; i++) {
		int sum{};
		for (int j = 0; j < counted.size(); j++) {
			if (counted[j] < i)
				break;
			sum += (counted[j] - counted[j] % i);	
		}
		cout << sum << ' ';
	}

    return 0;
}