#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; unordered_multiset<int> ms; for (int i = 0; i < n; i++) { int x; cin >> x; ms.insert(x); } unordered_set<int> s(ms.begin(), ms.end()); vector<int> counts; for (int x : s) counts.push_back(ms.count(x)); vector<int> res(n+1, 0); for (int x : counts) for (int i = 1; i <= x; i++) res[i] += x - x % i; for (int i = 1; i <= n; i++) cout << res[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 | #include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; unordered_multiset<int> ms; for (int i = 0; i < n; i++) { int x; cin >> x; ms.insert(x); } unordered_set<int> s(ms.begin(), ms.end()); vector<int> counts; for (int x : s) counts.push_back(ms.count(x)); vector<int> res(n+1, 0); for (int x : counts) for (int i = 1; i <= x; i++) res[i] += x - x % i; for (int i = 1; i <= n; i++) cout << res[i] << ' '; cout << '\n'; return 0; } |