#include <bits/stdc++.h> #define pb push_back #define st first #define nd second using ll = long long; using ld = long double; using namespace std; const int N = 300005; unordered_map <int,int> m; int ans[N]; vector <int> wart; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for(int i = 0; i < n; i++) { int x; cin >> x; m[x]++; } for(auto i : m) { wart.pb(i.second); } for(int i = 0; i < wart.size(); i++) { for(int ii = 1; ii <= wart[i]; ii++) { ans[ii] += ((wart[i] / ii) * ii); } } for(int i = 1; i <= n; i++) { cout << ans[i] << ' '; } 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 <bits/stdc++.h> #define pb push_back #define st first #define nd second using ll = long long; using ld = long double; using namespace std; const int N = 300005; unordered_map <int,int> m; int ans[N]; vector <int> wart; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for(int i = 0; i < n; i++) { int x; cin >> x; m[x]++; } for(auto i : m) { wart.pb(i.second); } for(int i = 0; i < wart.size(); i++) { for(int ii = 1; ii <= wart[i]; ii++) { ans[ii] += ((wart[i] / ii) * ii); } } for(int i = 1; i <= n; i++) { cout << ans[i] << ' '; } return 0; } |