#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,a,s; cin >> n; map<int,int>m; for (int i = 0; i < n; i++){ cin >> a; m[a]++; } int t[m.size()]; a = 0; for (auto it = m.begin(); it != m.end(); it++){ t[a] = it->second; a++; } sort(t, t + m.size(), greater<int>()); cout << n << " "; for (int i = 2; i < n + 1; i++){ s = 0; for (int j = 0; j < m.size(); j++){ int x = t[j]; if(x < i)break; s += x - (x % i); } cout << s << " "; } 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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,a,s; cin >> n; map<int,int>m; for (int i = 0; i < n; i++){ cin >> a; m[a]++; } int t[m.size()]; a = 0; for (auto it = m.begin(); it != m.end(); it++){ t[a] = it->second; a++; } sort(t, t + m.size(), greater<int>()); cout << n << " "; for (int i = 2; i < n + 1; i++){ s = 0; for (int j = 0; j < m.size(); j++){ int x = t[j]; if(x < i)break; s += x - (x % i); } cout << s << " "; } return 0; } |