#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
map<int, int> m;
for (int i = 0, e; i < n; i++) {
cin >> e;
m[e]++;
}
vector<int> v;
for (auto &e : m) {
v.push_back(e.second);
}
sort(v.rbegin(), v.rend());
for (int i = 1; i <= n; i++) {
int cnt = 0;
for (auto e : v) {
int d = e / i * i;
if (d == 0) {
break;
}
cnt += d;
}
cout << cnt << ' ';
}
cout << endl;
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 31 32 33 34 35 36 37 38 39 40 41 | #include<iostream> #include<vector> #include<map> #include<algorithm> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; map<int, int> m; for (int i = 0, e; i < n; i++) { cin >> e; m[e]++; } vector<int> v; for (auto &e : m) { v.push_back(e.second); } sort(v.rbegin(), v.rend()); for (int i = 1; i <= n; i++) { int cnt = 0; for (auto e : v) { int d = e / i * i; if (d == 0) { break; } cnt += d; } cout << cnt << ' '; } cout << endl; return 0; } |
English