{"categories":["PE","\u6570\u5b66","\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0"],"provider_url":"https://hatena.blog","title":"Project Euler 139","version":"1.0","blog_title":"inamori\u2019s diary","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100729%2Fp1\" title=\"Project Euler 139 - 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>","url":"https://inamori.hateblo.jp/entry/20100729/p1","author_url":"https://blog.hatena.ne.jp/inamori/","image_url":null,"author_name":"inamori","type":"rich","width":"100%","description":"http://projecteuler.net/index.php?section=problems&id=139 \u5358\u306b\u30d4\u30bf\u30b4\u30e9\u30b9\u6570\u3067\u6761\u4ef6\u306b\u5408\u3046\u7d44\u5408\u305b\u3092\u6570\u3048\u3066\u30821\u5206\u304f\u3089\u3044\u3067\u3057\u305f\u3002 from itertools import * from fractions import gcd def gen_primitive_Pythagorean(L): for m in takewhile(lambda m: m * (2 * m + 1) <= L, count(2)): n0 = m + 2 if m % 2 == 1 else m + 1 for n_ in (n for n in xrange\u2026","published":"2010-07-29 00:00:00","provider_name":"Hatena Blog","blog_url":"https://inamori.hateblo.jp/","height":"190"}