#include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back const int N = 1e9+9; vector<int> num; unordered_map<int,int> occ; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for (int i=0; i<n; i++){ int a; cin >> a; occ[a]++; } for (auto u: occ) num.pb(u.second); int res = n, k = 2; cout << res << " "; while (k<=n && res){ int mx = 0; for (int i=0; i<num.size(); i++) mx += (num[i] - num[i]%k); res = mx; cout << res << " "; k ++; } while (k<=n){ cout << "0 "; k ++; } 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 30 31 32 33 34 35 36 37 38 39 | #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back const int N = 1e9+9; vector<int> num; unordered_map<int,int> occ; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; for (int i=0; i<n; i++){ int a; cin >> a; occ[a]++; } for (auto u: occ) num.pb(u.second); int res = n, k = 2; cout << res << " "; while (k<=n && res){ int mx = 0; for (int i=0; i<num.size(); i++) mx += (num[i] - num[i]%k); res = mx; cout << res << " "; k ++; } while (k<=n){ cout << "0 "; k ++; } cout << "\n"; return 0; } |