#include <iostream> #include <vector> #include <unordered_map> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n,ipt,val; cin>>n; unordered_map<int,int> values; vector<int> counter(n); for(int i=0;i<n;++i) { cin>>ipt; ++values[ipt]; } auto end=values.end(); for (auto j = values.begin(); j != end; ++j) { val=j->second; for(int i=2;i<=n;++i) { counter[i-1]+=(val-val%i); } } cout<<n; for(int i=1;i<n;++i) { cout<<" "<<counter[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 | #include <iostream> #include <vector> #include <unordered_map> using namespace std; int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n,ipt,val; cin>>n; unordered_map<int,int> values; vector<int> counter(n); for(int i=0;i<n;++i) { cin>>ipt; ++values[ipt]; } auto end=values.end(); for (auto j = values.begin(); j != end; ++j) { val=j->second; for(int i=2;i<=n;++i) { counter[i-1]+=(val-val%i); } } cout<<n; for(int i=1;i<n;++i) { cout<<" "<<counter[i]; } return 0; } |