{"height":"190","published":"2010-03-17 00:00:00","url":"https://inamori.hateblo.jp/entry/20100317/p1","blog_url":"https://inamori.hateblo.jp/","version":"1.0","image_url":null,"author_name":"inamori","provider_name":"Hatena Blog","title":"Project Euler 7","type":"rich","description":"http://projecteuler.net/index.php?section=problems&id=7 Haskell\u306a\u3089\u3001 is_prime n = all (\\p -> mod n p /= 0) (takeWhile (\\p -> p * p <= n) primes) primes = 2:(filter is_prime [3,5..]) n = 10001 pair = head (filter (\\(k,_) -> k == n) (zip [1..] primes)) main = print (snd pair) all,takewhile,head,zip\u3092\u5b9a\u7fa9\u3057\u305f\u2026","categories":["PE","C++"],"author_url":"https://blog.hatena.ne.jp/inamori/","blog_title":"inamori\u2019s diary","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100317%2Fp1\" title=\"Project Euler 7 - 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>","width":"100%","provider_url":"https://hatena.blog"}