{"width":"100%","title":"SRM499 Div2 Easy","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2From-k.hatenadiary.org%2Fentry%2F20110429%2F1304075767\" title=\"SRM499 Div2 Easy - coding@ease\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_url":"https://hatena.blog","type":"rich","published":"2011-04-29 20:16:07","provider_name":"Hatena Blog","height":"190","blog_title":"coding@ease","blog_url":"https://rom-k.hatenadiary.org/","description":"\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3092\u8003\u3048\u308b\u306e\u306b\u5c11\u3057\u6642\u9593\u304c\u304b\u304b\u3063\u305f\u3051\u3069\u3001\u901f\u3044\u306e\u304c\u66f8\u3051\u305f\u3002 \u3057\u304b\u3057\u3001\u4ed6\u306e\u4eba\u306e\u30bd\u30fc\u30b9\u3092\u898b\u3066\u307f\u305f\u3089\u30d6\u30eb\u30fc\u30c8\u30d5\u30a9\u30fc\u30b9\u3067\u3001\u30bd\u30fc\u30b9\u3082\u3082\u3063\u3068\u77ed\u304b\u3063\u305f\u3002\u7af6\u6280\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u306a\u3093\u3060\u304b\u3089\u3001\u5236\u7d04\u306e\u7bc4\u56f2\u5185\u3067\u300c\u65e9\u304f\u300d\u300c\u78ba\u5b9f\u306a\u300d\u30b3\u30fc\u30c9\u3092\u66f8\u3051\u3070\u3044\u3044\u3063\u3066\u3053\u3068\u3060\u3002\u7f8e\u3057\u304f\u8208\u5473\u6df1\u3044\u30bd\u30fc\u30b9\u3067\u3042\u308b\u5fc5\u8981\u306f\u7121\u3044\u3002\u306a\u308b\u307b\u3069\u3002\u307e\u3041iterator\u306e\u7df4\u7fd2\u306b\u306f\u306a\u3063\u305f\u304b\u3089\u826f\u3057\u3002 class SimpleGuess { public: int getMaximum(vector <int> hints) { set<int> even; set<int> odd; FORI(i, hints.size()) { if (hints[i] % 2\u2026","author_url":"https://blog.hatena.ne.jp/rom_k/","author_name":"rom_k","image_url":null,"version":"1.0","categories":["topcoder"],"url":"https://rom-k.hatenadiary.org/entry/20110429/1304075767"}