{"url":"https://blog.muchance.jp/entry/2017/05/11/233000","title":"Project Euler 7","author_url":"https://blog.hatena.ne.jp/muchance/","height":"190","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fblog.muchance.jp%2Fentry%2F2017%2F05%2F11%2F233000\" title=\"Project Euler 7 - mu chance or much chance ?\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_name":"muchance","blog_url":"https://blog.muchance.jp/","provider_url":"https://hatena.blog","published":"2017-05-11 23:30:00","type":"rich","description":"\u554f\u984c Problem 7\uff1a10001st prime 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? \u89e3\u7b54\u4f8b def primeNum(num): prime = [2] i = 3 while len(prime) < num: for n in prime: if i % n == 0: break else: prime.append(i) i += 2 return p\u2026","image_url":null,"provider_name":"Hatena Blog","blog_title":"mu chance or much chance ?","version":"1.0","categories":["Project Euler"]}