{"categories":["Haskell"],"height":"190","title":"Project Euler 47","blog_url":"https://inamori.hateblo.jp/","provider_url":"https://hatena.blog","blog_title":"inamori\u2019s diary","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100216%2Fp2\" title=\"Project Euler 47 - 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":"http://projecteuler.net/index.php?section=problems&id=47 \u9806\u306b\u7d20\u56e0\u6570\u5206\u89e3\u3059\u308c\u3070\u7b54\u3048\u306f\u51fa\u308b\u3002 is_prime n = all (\\p -> mod n p /= 0) (takeWhile (\\p -> p * p <= n) primes) primes = 2:(filter is_prime [3,5..]) div_pow n p | mod n p /= 0 = (n, 0) | otherwise = (\\(n, e) -> (n, e + 1)) (div_pow (div n p) p) factorize 1 ps = \u2026","type":"rich","width":"100%","url":"https://inamori.hateblo.jp/entry/20100216/p2","author_url":"https://blog.hatena.ne.jp/inamori/","provider_name":"Hatena Blog","image_url":null,"version":"1.0","published":"2010-02-16 00:00:01","author_name":"inamori"}