#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
unordered_map<ll, ll> umap;
ll num = 2e7;
ll val;
for (ll i = 0; i < num; ++i)
{
val = rand() % (10000009);
cin >> umap[i];
}
ll n = umap.bucket_count();
cout << "umap has " << n << " buckets.\n\n";
ll collisions = 0;
for (ll i = 0; i < n; i++) {
if(umap.bucket_size(i) > 1)
{
cout << "Bucket " << i << " has "
<< umap.bucket_size(i) << " elements.\n";
collisions++;
}
}
cout << "Total Collisions: "<< collisions << "\n";
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+IAp1c2luZyBuYW1lc3BhY2Ugc3RkOyAKI2RlZmluZSBsbCBsb25nIGxvbmcKaW50IG1haW4oKSAKeyAKICAgIHVub3JkZXJlZF9tYXA8bGwsIGxsPiB1bWFwOwogICAgbGwgbnVtID0gMmU3OwogICAgbGwgdmFsOyAgICAgICAgCgogICAgZm9yIChsbCBpID0gMDsgaSA8IG51bTsgKytpKQogICAgewogICAgICAgIHZhbCA9IHJhbmQoKSAlICgxMDAwMDAwOSk7CiAgICAgICAgY2luID4+IHVtYXBbaV07CiAgICB9CgogICAgbGwgbiA9IHVtYXAuYnVja2V0X2NvdW50KCk7IAogICAgY291dCA8PCAidW1hcCBoYXMgIiA8PCBuIDw8ICIgYnVja2V0cy5cblxuIjsgCgogICAgbGwgY29sbGlzaW9ucyA9IDA7CiAgICBmb3IgKGxsIGkgPSAwOyBpIDwgbjsgaSsrKSB7IAogICAgICAgIGlmKHVtYXAuYnVja2V0X3NpemUoaSkgPiAxKQogICAgICAgIHsKICAgICAgICAgICAgY291dCA8PCAiQnVja2V0ICIgPDwgaSA8PCAiIGhhcyAiCiAgICAgICAgICAgIDw8IHVtYXAuYnVja2V0X3NpemUoaSkgPDwgIiBlbGVtZW50cy5cbiI7IAogICAgICAgICAgICBjb2xsaXNpb25zKys7CiAgICAgICAgfQogICAgfSAKCiAgICBjb3V0IDw8ICJUb3RhbCBDb2xsaXNpb25zOiAiPDwgY29sbGlzaW9ucyA8PCAiXG4iOyAKICAgIHJldHVybiAwOyAKfSAK