#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <iterator>
using namespace std;
int main() {
unordered_map<int, bool> m;
int i = -1;
std::generate_n(std::inserter(m, m.begin()),
10,
[&i](){++i; return std::make_pair(i, i % 2 == 0);});
for (auto const &p: m)
std::cout << '<' << p.first << ", " << p.second << ">\n";
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dW5vcmRlcmVkX21hcD4KI2luY2x1ZGUgPGl0ZXJhdG9yPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7Cgl1bm9yZGVyZWRfbWFwPGludCwgYm9vbD4gbTsKCWludCBpID0gLTE7CglzdGQ6OmdlbmVyYXRlX24oc3RkOjppbnNlcnRlcihtLCBtLmJlZ2luKCkpLAoJICAgICAgICAgICAgICAgIDEwLAoJICAgICAgICAgICAgICAgIFsmaV0oKXsrK2k7IHJldHVybiBzdGQ6Om1ha2VfcGFpcihpLCBpICUgMiA9PSAwKTt9KTsKCWZvciAoYXV0byBjb25zdCAmcDogbSkgCgkgICAgc3RkOjpjb3V0IDw8ICc8JyA8PCBwLmZpcnN0IDw8ICIsICIgPDwgcC5zZWNvbmQgPDwgIj5cbiI7CglyZXR1cm4gMDsKfQ==
<9, 0>
<8, 1>
<7, 0>
<6, 1>
<5, 0>
<4, 1>
<3, 0>
<2, 1>
<1, 0>
<0, 1>