{"blog_title":"inamori\u2019s diary","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100305%2Fp1\" title=\"Project Euler 72 - 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>","provider_url":"https://hatena.blog","description":"http://projecteuler.net/index.php?section=problems&id=72 \u30a8\u30e9\u30c8\u30b9\u30c6\u30cd\u30b9\u306e\u3075\u308b\u3044\u304c\u306a\u305c\u3053\u3093\u306a\u306b\u9045\u3044\u306e\u304b\u3002 import Data.Array make_primes n = filter (a!) [2..n] where a = sieve (array (2, n) [ (k, True) | k <- [2..n] ]) 2 sieve a p | a!p = sieve (a // [ (m, False) | m <- b, a!m ]) (p + 1) | p * p > n = a | otherwise = sieve a\u2026","title":"Project Euler 72","author_url":"https://blog.hatena.ne.jp/inamori/","url":"https://inamori.hateblo.jp/entry/20100305/p1","type":"rich","width":"100%","categories":["Haskell"],"provider_name":"Hatena Blog","height":"190","published":"2010-03-05 00:00:02","version":"1.0","blog_url":"https://inamori.hateblo.jp/","image_url":null,"author_name":"inamori"}