#include <iostream> #include <unordered_map> #include <vector> using namespace std; #define DBG 0 int main() { int n; cin >> n; unordered_map<int, int> c; for (int i = 0; i < n; ++i) { int ci; cin >> ci; c[ci]++; } vector<int> ans; ans.resize(n+1); for (auto cnt : c) { if (DBG) { cout << "city: " << cnt.first << ' ' << cnt.second << endl; } for (int ch = 1; ch <= cnt.second; ++ch) { ans[ch] += cnt.second / ch; if (DBG) { cout << ans[ch] << ' '; } } if (DBG) { cout << endl; } } for (int i = 1; i <=n; ++i) { cout << ans[i] * 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 | #include <iostream> #include <unordered_map> #include <vector> using namespace std; #define DBG 0 int main() { int n; cin >> n; unordered_map<int, int> c; for (int i = 0; i < n; ++i) { int ci; cin >> ci; c[ci]++; } vector<int> ans; ans.resize(n+1); for (auto cnt : c) { if (DBG) { cout << "city: " << cnt.first << ' ' << cnt.second << endl; } for (int ch = 1; ch <= cnt.second; ++ch) { ans[ch] += cnt.second / ch; if (DBG) { cout << ans[ch] << ' '; } } if (DBG) { cout << endl; } } for (int i = 1; i <=n; ++i) { cout << ans[i] * i << ' '; } return 0; } |