{"published":"2011-10-15 00:00:00","description":"\u30a8\u30e9\u30c8\u30b9\u30c6\u30cd\u30b9\u306e\u3075\u308b\u3044\u306e\u901f\u5ea6\u3092\u78ba\u8a8d\u3057\u307e\u3059\u3002\u307e\u305a\u306f\u6700\u3082\u5358\u7d14\u306a\u3082\u306e\u3002 def sieve1(N): a = [ True ] * (N + 1) for p in takewhile(lambda p: p * p <= N, (n for n in count(2) if a[n])): for k in xrange(p * 2, N + 1, p): a[k] = False return [ n for n in xrange(2, N + 1) if a[n] ] t0 = time.clock() N = 10 ** 6 primes = sieve1(N) print len(pri\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20111015%2Fp1\" title=\"Python\u3067\u7d20\u6570\u5224\u5b9a\uff083\uff09 - 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>","author_url":"https://blog.hatena.ne.jp/inamori/","version":"1.0","width":"100%","url":"https://inamori.hateblo.jp/entry/20111015/p1","provider_url":"https://hatena.blog","height":"190","author_name":"inamori","blog_url":"https://inamori.hateblo.jp/","blog_title":"inamori\u2019s diary","image_url":null,"provider_name":"Hatena Blog","title":"Python\u3067\u7d20\u6570\u5224\u5b9a\uff083\uff09","type":"rich","categories":["\u6570\u5b66","\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0","Python"]}