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

using namespace std;

int main()
{
    int n;
    cin >> n;
    int temp;
    map<int, int> zn;
    for (int i = 0; i<n; i++) {
        cin >> temp;
        /*
        if (zn.find(temp) == zn.end()) {
            zn[temp] = 1;
        } else {

        }
        */
        zn[temp]++;
    }
    vector<int> v;
    for (auto i = zn.begin(); i != zn.end(); i++) {
        v.push_back(i->second);
    }
    sort(v.begin(), v.end());
    for (int i = 1; i<n; i++) {
        int res = 0;
        for (int j : v) {
            res += (floor(j/i)*i);
        }
        cout << res << endl;
    }
    return 0;
}