{"published":"2019-07-19 16:12:08","categories":["\u7af6\u30d7\u30ed","AtCoder","AGC035","A\u554f\u984c","300\u70b9","Rust"],"height":"190","version":"1.0","author_url":"https://blog.hatena.ne.jp/amifiable/","description":"irisrune\u3067\u3059\u3002\u4e00\u5fdcRust\u7b2c2\u56de\u3067\u3059\u3002 \u554f\u984c atcoder.jp 300\u70b9\u554f\u984c\u3067\u3059\u304c\u3001\u6b63\u653b\u6cd5\u3067\u89e3\u3053\u3046\u3068\u3059\u308b\u3068\u8003\u616e\u3059\u3079\u304d\u30b1\u30fc\u30b9\u3092\u6574\u7406\u3057\u305f\u308a\u5b9f\u88c5\u304c\u3084\u3084\u9762\u5012\u3060\u3063\u305f\u308a\u3068\u5384\u4ecb\u306a\u554f\u984c\u3067\u3059\u3002 use std::collections::HashMap; fn main() { input!{ n: usize, la: [usize; n] } let mut map: HashMap<usize, usize> = HashMap::new(); for a in la { let value = map.entry(a).or_insert(0); *value += 1; } if map.\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fami-atcoder.hatenablog.com%2Fentry%2F20190719%2F1563520328\" title=\"AtCoder AGC 035 A - XOR Circle \u203b\u6b63\u653b\u6cd5 (Rust) - \u3042\u308b\u30a8\u30f3\u30b8\u30cb\u30a2\u306eAtCoder\u596e\u95d8\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"\u3042\u308b\u30a8\u30f3\u30b8\u30cb\u30a2\u306eAtCoder\u596e\u95d8\u8a18","width":"100%","blog_url":"https://ami-atcoder.hatenablog.com/","author_name":"amifiable","provider_url":"https://hatena.blog","type":"rich","provider_name":"Hatena Blog","image_url":"https://cdn.user.blog.st-hatena.com/default_entry_og_image/154149487/1553670776372553","url":"https://ami-atcoder.hatenablog.com/entry/20190719/1563520328","title":"AtCoder AGC 035 A - XOR Circle \u203b\u6b63\u653b\u6cd5 (Rust)"}