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
#include "bits/stdc++.h" // Ignacy Boehlke
using namespace std;     // XIII LO Szczecin
auto operator<<(auto&o,auto p)->decltype(p.first,o){return o<<'{'<<p.first<<", "<<p.second<<'}';}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<'{';int i=2;for(auto e:x)o<<(", ")+i<<e,i=0;return o<<'}';}
#ifdef DEBUG
#define PF(x...)fprintf(stderr,x)
#define LOG(x...)cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<'\n';}(x)
#else
#define PF(...)(void)0
#define LOG(...)(void)0
#endif
#define FOR(a,b,c)for(int a=(b);a<=(c);++a)
#define REP(a,b)FOR(a,0,(b)-1)
#define ALL(x)(x).begin(), (x).end()
#define fi first
#define se second
using ll=int64_t;

int main() {
        cin.tie(0)->sync_with_stdio(0);
        int n;
        cin >> n;
        unordered_map<int, int> freq;
        REP(i, n) {
                int x;
                cin >> x;
                ++freq[x];
        }
        unordered_map<int, int> freq2;
        for (auto [key, val] : freq) ++freq2[val];

        vector<pair<int, int>> cnts;
        for (auto p : freq2) cnts.push_back(p);

        FOR(k, 1, n) {
                int res = 0;
                for (auto [a, b] : cnts) res += (a / k) * b;
                cout << res * k << ' ';
        }
        cout << '\n';
}