#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false);
unordered_map<int, int> m;
vector<int> wyn;
int n, a;
cin >> n;
wyn.resize(n + 1);
for (int i = 0; i < n; ++i)
{
cin >> a;
++m[a];
}
for (auto& i : m)
{
int j = 1, r = i.second;
while (j <= n && (r / j) > 0)
{
wyn[j] += (r / j) * j;
++j;
}
}
for (int i = 1; i <= n; ++i)
cout << wyn[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 | #include <bits/stdc++.h> #define ll long long using namespace std; int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); unordered_map<int, int> m; vector<int> wyn; int n, a; cin >> n; wyn.resize(n + 1); for (int i = 0; i < n; ++i) { cin >> a; ++m[a]; } for (auto& i : m) { int j = 1, r = i.second; while (j <= n && (r / j) > 0) { wyn[j] += (r / j) * j; ++j; } } for (int i = 1; i <= n; ++i) cout << wyn[i] << ' '; cout << '\n'; return 0; } |
English