#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n; cin >> n;
vector<int> v(n);
for (auto &i : v) cin >> i;
map<int, int> m;
for (auto i : v) m[i]++;
vector<int> occurence;
for (auto pair : m) occurence.push_back(pair.second);
sort(occurence.begin(), occurence.end(), greater<int>());
vector<int> ans(n+1, 0);
for (int i = 1; i <= n; i++) {
for (auto occ : occurence) {
if (occ < i) break;
ans[i] += (occ - occ % i);
}
}
for (int i = 1; i <= n; i++) cout << ans[i] << " ";
cout << "\n";
return 0;
}
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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<int> v(n); for (auto &i : v) cin >> i; map<int, int> m; for (auto i : v) m[i]++; vector<int> occurence; for (auto pair : m) occurence.push_back(pair.second); sort(occurence.begin(), occurence.end(), greater<int>()); vector<int> ans(n+1, 0); for (int i = 1; i <= n; i++) { for (auto occ : occurence) { if (occ < i) break; ans[i] += (occ - occ % i); } } for (int i = 1; i <= n; i++) cout << ans[i] << " "; cout << "\n"; return 0; } |
English