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
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;

#define PB emplace_back
#define int long long
#define ll long long
#define vi vector<int>
#define siz(a) ((int) ((a).size()))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
void print(vi n) { rep(i, 0, siz(n) - 1) cerr << n[i] << " \n"[i == siz(n) - 1]; }

const int N = 3e5;
int a, s[N + 5], t[N + 5], ans[N + 5];

signed main() {
	// freopen(".in", "r", stdin);
	// freopen(".out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> a;
	rep(i, 1, a) cin >> s[i];
	sort(s + 1, s + a + 1);
	rep(i, 1, a) {
		int j = i;
		for(; j + 1 <= a && s[j + 1] == s[j]; ++j);
		++t[j - i + 1];
		i = j;
	}
	rep(i, 1, a) t[i] += t[i - 1];
	rep(i, 1, a) {
		for(int j = i; j <= a; j += i) ans[i] += (t[min(a, j + i - 1)] - t[j - 1]) * j;
	}
	rep(i, 1, a) cout << ans[i] << ' ';
	return cerr << endl << 1.0 * clock() / CLOCKS_PER_SEC << endl, 0;
}