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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
#include <cmath>
#include <iostream>
#include <vector>
#include <unordered_map>
#include <unordered_set>

int main()
{
    /*std::vector<int> primes;
    primes.push_back(2);
    for (int i = 3; i < 548; ++i) {
        bool prime = true;
        for (auto p : primes) {
            if (i % p == 0) {
                prime = false;
                break;
            }
        }
        if (prime) primes.push_back(i);
    }*/

    //std::cout << primes.size() << std::endl;

    int n;
    std::cin >> n;
    std::unordered_map<int, int> counts;
    std::vector<int> stamps(n + 1);

    for (int i = 0; i < n; ++i) {
        int c;
        std::cin >> c;
        ++counts[c];
    }

    for (auto [_, count] : counts) {
        int left = count;
        int maxi = 0;
        for (long long i = 1; i * i <= (long long)count; ++i) {
            ++stamps[count / i];
            --left;
            maxi = i;
        }

        for (int i = maxi; i >= 1; --i) {
            int used = count - left;
            int to_use = std::max(count / i - used, 0);
            stamps[i] += to_use;
            left -= to_use;
        }

        //std::cerr << left << std::endl;
        stamps[1] += left;
    }

    for (int i = n - 1; i >= 1; --i) {
        stamps[i] += stamps[i + 1];
    }

    for (int i = 1; i <= n; ++i) {
        std::cout << stamps[i] * i << " ";
    }
    std::cout << std::endl;

    return 0;
}