{"published":"2010-02-28 00:00:00","version":"1.0","blog_title":"inamori\u2019s diary","description":"Problem 67 http://projecteuler.net/index.php?section=problems&id=67 \u4e0a\u304b\u3089\u9806\u306b\u8a08\u7b97\u3057\u3066\u3044\u304f\u3002\u4e0a\u306b\u524d\u3068\u5f8c\u308d\u3069\u3061\u3089\u304b\u306b0\u3092\u4ed8\u52a0\u3057\u3066\u52a0\u7b97\u3059\u308b\u3002 3 3 0 0 3 7 4 7 4 7 4 -> 11 4 7 7 11 7 add a b = [ m + n | (m, n) <- zip a b ] next a b = [ max m n | (m, n) <- zip (add (a ++ [0]) b) (add (0:a) b) ] max_path :: [Char] -> Int max_path s = foldr m\u2026","title":"Project Euler 67,69","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100228%2Fp1\" title=\"Project Euler 67,69 - inamori\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","type":"rich","provider_name":"Hatena Blog","url":"https://inamori.hateblo.jp/entry/20100228/p1","blog_url":"https://inamori.hateblo.jp/","image_url":null,"height":"190","author_name":"inamori","categories":["Haskell"],"width":"100%","author_url":"https://blog.hatena.ne.jp/inamori/","provider_url":"https://hatena.blog"}