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
#include <iostream>
#include <algorithm>
#include <unordered_map>

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
    
    int n;
    std::cin >> n;

    int count[n] {0};
    count[0] = n;

    std::unordered_map<int, int> cityCount;
    int temp;
    for(int i = 0; i < n; ++i) {
        std::cin >> temp;
        ++cityCount[temp];
    }

    for(auto city : cityCount) {
        for(int j = 1; j < n; ++j) {
            if(city.second >= j + 1) {
                count[j] += city.second - (city.second % (j + 1));
            }
         }
    }

    for(int i = 0; i < n; ++i) {
        std::cout << count[i] << ' ';
    }
    
    return 0;
}