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
66
67
68
69
70
71
72
73
74
75
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<")";}
auto&operator<<(auto&o,tuple<auto,auto,auto,auto>t){return o<<"("<<get<0>(t)<<", "<<get<1>(t)<<", "<<get<2>(t)<<", "<<get<3>(t)<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

vector<pair<int, int>> same_floor(int n) {
	vector<pair<int, int>> v;
	for (int l = 1, r; l <= n; l = r + 1) {
		r = n / (n / l);
		v.emplace_back(l, r);
	}
	return v;
}
struct Fenwick {
	vector<LL> s;
	Fenwick(int n) : s(n) {}
	void update(int pos, LL val) {
		for(; pos < ssize(s); pos |= pos + 1)
			s[pos] += val;
	}
	LL query(int pos) {
		LL ret = 0;
		for(pos++; pos > 0; pos &= pos - 1)
			ret += s[pos - 1];
		return ret;
	}
	LL query(int l, int r) {
		return query(r) - query(l - 1);
	}
};
struct RangeAdd {
	Fenwick f;
	RangeAdd(int n) : f(n) {}
	void update(int l, int r, LL val) {
		f.update(l, val);
		f.update(r + 1, -val);
	}
	LL query(int pos) {
		return f.query(pos);
	}
};

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int n;
	cin >> n;
	vector<int> ans(n + 1);
	map<int, int> m;
	REP(i, n) {
		int x;
		cin >> x;
		++m[x];
	}
	RangeAdd tree(n + 1);
	for (auto [_, cnt] : m) {
		for (auto [l, r] : same_floor(cnt)) {
			debug(_, cnt, l, r, cnt / l);
			tree.update(l, r, cnt / l);
		}
	}
	FOR(i, 1, n)
		cout << tree.query(i) * i << (i == n ? '\n' : ' ');
}