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
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int a, p[n], m[n]={0}, s=0;
	vector<int> v;
	
	for(int i=0; i<n; i++)
	{
		p[i]=1;
		cin>>a;
		v.push_back(a);
	}
	
	sort(v.begin(), v.end());
	
	for(int c=1; c<v.size(); c++)
	{
		if(v[c]==v[c-1])
		{
			p[c]++;
			v.erase(v.begin()+c);
			c--;
		}
	}
	
	for(int j=1; j<=n; j++)
	{
		s=0;
		if(j==1)
		s=n;
		else
		for(int l=0; l<n; l++)
		{
			if(p[l]>1)
			if(p[l]/j>=1)
			s+=p[l]-p[l]%j;
		}
		
		cout<<s<<" ";
	}
	
	return 0;
}