{"url":"https://inamori.hateblo.jp/entry/20100227/p1","version":"1.0","title":"Project Euler 65,66","author_url":"https://blog.hatena.ne.jp/inamori/","categories":["Haskell"],"type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100227%2Fp1\" title=\"Project Euler 65,66 - 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>","author_name":"inamori","description":"Problem 65 http://projecteuler.net/index.php?section=problems&id=65 \u9023\u5206\u6570\u306e\u8a08\u7b97\u6cd5\u3092\u9069\u7528\u3059\u308b\u3002\u6700\u521d\u306b1\u3092\u4ed8\u52a0\u3059\u308b\u3068\u8a08\u7b97\u3057\u3084\u3059\u3044\u3002 digits 0 = [] digits n = (mod n 10):(digits (div n 10)) a = 2:1:2:1:[ if n == 1 then 1 else n + 2 | n <- tail a ] p = 1:(head a):[ a1 * p1 + p0 | (a1, p0, p1) <- zip3 (tail a) p (tail p) ] main = print\u2026","image_url":null,"provider_name":"Hatena Blog","published":"2010-02-27 00:00:01","blog_url":"https://inamori.hateblo.jp/","blog_title":"inamori\u2019s diary","width":"100%","height":"190","provider_url":"https://hatena.blog"}