{"type":"rich","height":"190","blog_url":"https://jeneshicc.hatenadiary.org/","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081026%2F1225000234\" title=\"Problem 10 - \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>","image_url":null,"description":"The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million. \u81ea\u5206\u304c\u5b9f\u88c5\u3057\u305f\u30a8\u30e9\u30c8\u30b9\u30c6\u30cd\u30b9\u306e\u3075\u308b\u3044\u306f\u9045\u304b\u3063\u305f\u3002\u5358\u7d14\u306a\u7d20\u6570\u751f\u6210\u3002 p010 = sum$takeWhile(<2000000)$primes primes = 2:filter isPrime [3,5..] isPrime x = all ((/= 0).mod x)$takeWhile (<= (floor.sqrt.fromIntegral$ x)) primes \u30a8\u30e9\u30c8\u30b9\u30c6\u30cd\u30b9\u6539\u826f \u2026","categories":["Project Euler"],"author_url":"https://blog.hatena.ne.jp/jeneshicc/","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","title":"Problem 10","published":"2008-10-26 14:50:34","provider_name":"Hatena Blog","url":"https://jeneshicc.hatenadiary.org/entry/20081026/1225000234","width":"100%","author_name":"jeneshicc","version":"1.0"}