#include <bits/stdc++.h>
using namespace std;
#define fwd(i, a, n) for (int i = (a); i < (n); i ++)
#define rep(i, n) fwd(i, 0, n)
#define all(X) begin(X), end(X)
#define sz(X) ((int)X.size())
#define st first
#define nd second
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#ifdef LOC
auto &operator<<(auto &out, pair<auto, auto> a) {
return out << "(" << a.st << ", " << a.nd << ")";
}
auto &operator<<(auto &out, auto a) {
out << "{";
for (auto b : a)
out << b << ", ";
return out << "}";
}
void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; }
#define debug(x...) cerr << __LINE__ << ": [" #x "]: ", dump(x)
#else
#define debug(...) 0
#endif
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n; cin>>n;
vector<int> a(n);
vector<int> res(n+1, 0);
rep(i, n)cin>>a[i];
sort(all(a));
debug(a);
vector<int> v;
int cnt = 1;
for(int i = 1; i < n; i++){
if(a[i] == a[i-1]){
cnt++;
}else{
v.push_back(cnt);
cnt = 1;
}
}
v.push_back(cnt);
debug(v);
for(auto x : v){
for(int i = 1; i <= x; i++){
res[i] += (x / i) * 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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 | #include <bits/stdc++.h> using namespace std; #define fwd(i, a, n) for (int i = (a); i < (n); i ++) #define rep(i, n) fwd(i, 0, n) #define all(X) begin(X), end(X) #define sz(X) ((int)X.size()) #define st first #define nd second #define pii pair<int, int> #define vi vector<int> #define ll long long #ifdef LOC auto &operator<<(auto &out, pair<auto, auto> a) { return out << "(" << a.st << ", " << a.nd << ")"; } auto &operator<<(auto &out, auto a) { out << "{"; for (auto b : a) out << b << ", "; return out << "}"; } void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; } #define debug(x...) cerr << __LINE__ << ": [" #x "]: ", dump(x) #else #define debug(...) 0 #endif int32_t main() { ios_base::sync_with_stdio(0), cin.tie(0); int n; cin>>n; vector<int> a(n); vector<int> res(n+1, 0); rep(i, n)cin>>a[i]; sort(all(a)); debug(a); vector<int> v; int cnt = 1; for(int i = 1; i < n; i++){ if(a[i] == a[i-1]){ cnt++; }else{ v.push_back(cnt); cnt = 1; } } v.push_back(cnt); debug(v); for(auto x : v){ for(int i = 1; i <= x; i++){ res[i] += (x / i) * i; } } for(int i = 1; i <= n; i++)cout<<res[i]<<" "; cout<<"\n"; return 0; } |
English