#include <unordered_map>
#include <iostream>
#include <ctime>
using namespace std;
int main(){
unordered_map<int,int> m;
int n = 100000;
int b = m.bucket_count();
cout << b << endl;
clock_t prev = clock();
for(int i = 0; i < n; i++){
++m[m.bucket_count()*i];
if(i%1000 == 0){
clock_t cur = clock();
cout << 1.*(cur - prev) / CLOCKS_PER_SEC << endl;
prev = cur;
}
}
}
I2luY2x1ZGUgPHVub3JkZXJlZF9tYXA+CiNpbmNsdWRlIDxpb3N0cmVhbT4KI2luY2x1ZGUgPGN0aW1lPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKXsKCXVub3JkZXJlZF9tYXA8aW50LGludD4gbTsKCWludCBuID0gMTAwMDAwOwoJaW50IGIgPSBtLmJ1Y2tldF9jb3VudCgpOwoJY291dCA8PCBiIDw8IGVuZGw7CgkKCWNsb2NrX3QgcHJldiA9IGNsb2NrKCk7Cglmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKCQkrK21bbS5idWNrZXRfY291bnQoKSppXTsKCQlpZihpJTEwMDAgPT0gMCl7CgkJCWNsb2NrX3QgY3VyID0gY2xvY2soKTsKCQkJY291dCA8PCAxLiooY3VyIC0gcHJldikgLyBDTE9DS1NfUEVSX1NFQyA8PCBlbmRsOwoJCQlwcmV2ID0gY3VyOwoJCX0KCX0KfQo=