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
// PA 2024 2C - Znaczki pocztowe
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;



int main()
{
	ios_base::sync_with_stdio(0);
	int a, n, result;
	unordered_map<int, int> counter;
	unordered_map<int, int> quantities;
	
	cin >> n;
	for (int i = 0; i < n; ++i) {
		cin >> a;
		if (counter.count(a) == 0) {
			counter[a] = 1;
		} else {
			counter[a] += 1;
		}
	}
	
	for (unordered_map<int, int>::iterator it = counter.begin(); it != counter.end(); ++it) {
		if (quantities.count(it->second) == 0) {
			quantities[it->second] = 1;
		} else {
			quantities[it->second] += 1;
		}
	}	
	
	
	for (int i = 1; i <= n; ++i) {
		if (result == 0) {
			cout << result << " ";
			continue;
		} 
		
		result = 0;
		for (unordered_map<int, int>::iterator it = quantities.begin(); it != quantities.end(); ++it) {
			result += it->first / i * i * it->second;
		}
		cout << result << " ";
	}	
	
	return 0;
}