{"provider_name":"Hatena Blog","title":"Problem 145","width":"100%","height":"190","provider_url":"https://hatena.blog","url":"https://jeneshicc.hatenadiary.org/entry/20081210/1228928328","type":"rich","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","version":"1.0","author_name":"jeneshicc","published":"2008-12-10 01:58:48","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081210%2F1228928328\" title=\"Problem 145 - \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>","blog_url":"https://jeneshicc.hatenadiary.org/","image_url":null,"categories":["Project Euler","Haskell"],"description":"http://projecteuler.net/index.php?section=problems&id=145 \u3068\u308a\u3042\u3048\u305a\u30ca\u30a4\u30fc\u30d6\u306a\u3082\u306e\u3002 import Data.Char revInt ::Integer -> Integer revInt = read.reverse.show reversible n = mod n 10 /= 0 && (all odd.map digitToInt.show.(+n).revInt) n p145 n = filter reversible [1..n] main = print.length.p145$10^5 \u3082\u3061\u308d\u3093\u89e3\u3051\u306a\u3044\uff08\u8a08\u7b97\u6642\u9593\u7684\u306a\u610f\u2026","author_url":"https://blog.hatena.ne.jp/jeneshicc/"}