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
#include<bits/stdc++.h>
using namespace std;

int a,n;
map<int, int> occurs;
map<int,int> o;
vector<int> keysToBeErased;
int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>a;
		occurs[a]++;
	}
	for(auto kv : occurs)
	{
		o[kv.second]++;
	}
	for(int i=1;i<=n;i++)
	{
		int result=0;
		for(auto kv:o)
		{
			if(kv.first<i)
				keysToBeErased.push_back(kv.first);
			else
				result += kv.first/i*i*kv.second;
		}
		for(int key : keysToBeErased)
			o.erase(key);
		keysToBeErased.clear();
		cout<<result<<" ";
	}
	return 0;
}