{"author_name":"inamori","height":"190","url":"https://inamori.hateblo.jp/entry/20100221/p2","width":"100%","blog_title":"inamori\u2019s diary","categories":["Haskell"],"author_url":"https://blog.hatena.ne.jp/inamori/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100221%2Fp2\" title=\"Project Euler 55,56 - 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>","description":"Problem 55 http://projecteuler.net/index.php?section=problems&id=55 \u7279\u306b\u306a\u306b\u3082\u306a\u3044\u3002 digits 0 = [] digits n = (digits (div n 10)) ++ [mod n 10] numerize a = foldl1 (\\x y -> x * 10 + y) a rev = numerize . reverse . digits is_palindromic n = n == (rev n) step n = n + (rev n) is_Lychrel n = f n 50 where f n 0 \u2026","title":"Project Euler 55,56","provider_name":"Hatena Blog","image_url":null,"blog_url":"https://inamori.hateblo.jp/","published":"2010-02-21 00:00:01","version":"1.0","type":"rich","provider_url":"https://hatena.blog"}