#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> tab(n); for (int i = 0; i < n; i++) { int a; cin >> a; tab[i] = a; } sort(tab.begin(), tab.end()); int count = 0; int last = tab[0]; vector<int> counttab(n + 1); for (int i = 0; i < n; i++) { if (tab[i] == last) count++; else { counttab[count]++; count = 1; last = tab[i]; } } counttab[count]++; vector<int> end(n); for (int i = 1; i <= n; i++) { if (counttab[i] == 0) continue; for (int a = 1; a <= n; a++) { if(a > i) break; end[a - 1] += counttab[i] * ((i / a) * a); } } for (int i = 0; i < n; i++) { cout << end[i] << " "; } }
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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<int> tab(n); for (int i = 0; i < n; i++) { int a; cin >> a; tab[i] = a; } sort(tab.begin(), tab.end()); int count = 0; int last = tab[0]; vector<int> counttab(n + 1); for (int i = 0; i < n; i++) { if (tab[i] == last) count++; else { counttab[count]++; count = 1; last = tab[i]; } } counttab[count]++; vector<int> end(n); for (int i = 1; i <= n; i++) { if (counttab[i] == 0) continue; for (int a = 1; a <= n; a++) { if(a > i) break; end[a - 1] += counttab[i] * ((i / a) * a); } } for (int i = 0; i < n; i++) { cout << end[i] << " "; } } |