{"author_name":"jeneshicc","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081026%2F1224993382\" title=\"Problem 7 - \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>","categories":["Project Euler"],"version":"1.0","blog_url":"https://jeneshicc.hatenadiary.org/","title":"Problem 7","height":"190","published":"2008-10-26 12:56:22","image_url":null,"width":"100%","author_url":"https://blog.hatena.ne.jp/jeneshicc/","url":"https://jeneshicc.hatenadiary.org/entry/20081026/1224993382","type":"rich","provider_name":"Hatena Blog","provider_url":"https://hatena.blog","description":"By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.What is the 10001st prime number? \u30a8\u30e9\u30c8\u30b9\u30c6\u30cd\u30b9\u306e\u3075\u308b\u3044\u3092\u666e\u901a\u306b\u5b9f\u88c5\u3057\u305f\u3089\u9045\u304b\u3063\u305f\u3002\u9ad8\u901f\u5316\u306b\u624b\u9593\u53d6\u3063\u305f\u3002 sieve ms ns= ms++(sieve ps rs) where (ps,qs)=span(<head ms ^2) ns rs= [q|q<-qs,and$map ((/=0).mod q) ms] p007 = sieve [2] [3,5..] \u2026","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66"}