#include <iostream> #include <vector> #include <map> using namespace std; int main() { std::ios_base::sync_with_stdio(false); int n; cin >> n; map<int, int> stamps; for (int i = 0; i < n; i++) { int x; cin >> x; stamps[x]++; } int sum = 0; map<int,int> counts; for (auto const &[k,v]: stamps) { sum += v; counts[v] += 1; } for (int i = 1; i <= n; i++) { int result = sum; for (auto const &[k, v]: counts) { result -= v * (k % i); } cout << result << " "; if (result == 0) { for (int j = i + 1; j <= n; j++) { cout << "0 "; } break; } } cout << endl; 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 <vector> #include <map> using namespace std; int main() { std::ios_base::sync_with_stdio(false); int n; cin >> n; map<int, int> stamps; for (int i = 0; i < n; i++) { int x; cin >> x; stamps[x]++; } int sum = 0; map<int,int> counts; for (auto const &[k,v]: stamps) { sum += v; counts[v] += 1; } for (int i = 1; i <= n; i++) { int result = sum; for (auto const &[k, v]: counts) { result -= v * (k % i); } cout << result << " "; if (result == 0) { for (int j = i + 1; j <= n; j++) { cout << "0 "; } break; } } cout << endl; return 0; } |