#include <iostream> #include <string> #include <algorithm> using namespace std; int main() { int n; cin >> n; cin.ignore(); string in; getline(cin, in); int z[n]; int m = 0; string l = " "; for (int i = 0; i < in.length(); i++){ if (in[i] == ' '){ z[m] = stoi(l); m++; l = " "; } else{ l += in[i]; } } z[m] = stoi(l); sort(z, z + n); int ms = 1; for (int i = 0; i < n - 1; i++){ if (z[i] != z[i + 1]) { ms++; } } int zm[ms] = {0}; int sm = 0; zm[0] = 1; for (int i = 0; i < n - 1; i++){ if (z[i] == z[i + 1]){ zm[sm]++; } else{ sm++; zm[sm] = 1; } } for (int i = 1; i <= n; i++){ int il = 0; for (int j = 0; j < ms; j++){ il += zm[j] / i * i; } cout << il << " "; } 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 61 62 63 | #include <iostream> #include <string> #include <algorithm> using namespace std; int main() { int n; cin >> n; cin.ignore(); string in; getline(cin, in); int z[n]; int m = 0; string l = " "; for (int i = 0; i < in.length(); i++){ if (in[i] == ' '){ z[m] = stoi(l); m++; l = " "; } else{ l += in[i]; } } z[m] = stoi(l); sort(z, z + n); int ms = 1; for (int i = 0; i < n - 1; i++){ if (z[i] != z[i + 1]) { ms++; } } int zm[ms] = {0}; int sm = 0; zm[0] = 1; for (int i = 0; i < n - 1; i++){ if (z[i] == z[i + 1]){ zm[sm]++; } else{ sm++; zm[sm] = 1; } } for (int i = 1; i <= n; i++){ int il = 0; for (int j = 0; j < ms; j++){ il += zm[j] / i * i; } cout << il << " "; } return 0; } |