{"blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","type":"rich","description":"\u30d8\u30dc\u30d8\u30dc\u3060\u3063\u305f\uff0c1B\u3060\u304c\uff0c\u306a\u3093\u3068\u304b\u901a\u904e\u3057\u3066\u3044\u305f\uff0e \u7df4\u7fd2\u306e\u305f\u3081\u306b\uff0c1C\u3082\u3084\u3063\u3066\u307f\u305f\uff0e \u6642\u9593\u5236\u9650\u3068\u304b\u30d7\u30ec\u30c3\u30b7\u30e3\u30fc\u304c\u306a\u3044\u3076\u3093\uff0c\u6c17\u697d\u3067\uff0c\u307e\u3041\u307e\u3041\u826f\u3044\u611f\u3058\u3060\u3063\u305f\uff08\u305f\u3076\u3093\uff0c\u554f\u984c\u3082\u7c21\u5358\u306b\u306a\u3063\u3066\u3044\u308b\uff09\uff0e\uff08\u524d\u56de\u3068\u540c\u3058\u30c6\u30f3\u30d7\u30ec\u30fc\u30c8\u3092\u4f7f\u7528\u3057\u3066\u3044\u307e\u3059\uff0e\uff09 A \u305d\u306e\u307e\u307e\uff0e\u305f\u3060\u3057\uff0c1\u9032\u6570\u306f\u8a31\u3055\u308c\u306a\u3044\u3053\u3068\u306b\u6ce8\u610f\uff0e main = do n <- getInt forM_ [1..n] $ \\i -> do s <- getLine putStrLn.output i $ f s f :: (Eq a) => [a] -> Integer f cs = foldl' add 0.mapMaybe (`lookup` m) $ \u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20090913%2F1252850700\" title=\"Round 1C (Google Code Jam 2009) - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/jeneshicc/","blog_url":"https://jeneshicc.hatenadiary.org/","author_name":"jeneshicc","url":"https://jeneshicc.hatenadiary.org/entry/20090913/1252850700","provider_name":"Hatena Blog","title":"Round 1C (Google Code Jam 2009)","width":"100%","version":"1.0","categories":["\u65e5\u8a18","Haskell"],"image_url":null,"provider_url":"https://hatena.blog","height":"190","published":"2009-09-13 23:05:00"}