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
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;


int main()
{
	int n;
	cin >> n;
	map<int, int> map;
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		map[a]++;
	}
	vector<int> vec;
	for (pair<int, int> p : map) {
		vec.push_back(p.second);
	}
	int size = vec.size();
	for (int i = 1; i <= n; i++) {
		int sum = 0;
		for (int j = 0; j < size; j++) {
			sum += vec[j] - (vec[j] % i);
		}
		cout << sum << " ";
	}
}