{"type":"rich","published":"2009-10-14 00:00:00","provider_name":"Hatena Blog","description":"\u30d7\u30ed\u30b8\u30a7\u30af\u30c8\u30aa\u30a4\u30e9\u30fc http://projecteuler.net/index.php?section=problems&id=73 \u524d\u306b\u3053\u306e\u554f\u984c\u3092\u89e3\u3044\u305f\u9803\u306f\u3001\u89e3\u3051\u308c\u3070\u3044\u3044\u3084\u3001\u3068\u3044\u3046\u3053\u3068\u3067\u305a\u3044\u3076\u3093\u96d1\u306b\u30b3\u30fc\u30c9\u3092\u66f8\u3044\u3066\u3044\u305f\u3002\u3053\u306e\u65e5\u306f9\u554f\u89e3\u3044\u305f\u3088\u3046\u3060\u3002 \u3068\u306b\u304b\u304f\u4f55\u306e\u5de5\u592b\u3082\u306a\u304f\u3057\u3089\u307f\u3064\u3076\u3057\u306b\u8abf\u3079\u3066\u3044\u305f\u3002 from itertools import imap from fractions import gcddef count_n(d): return sum(imap(lambda n: gcd(n, d) == 1, xrange(d / 3 + 1, (d + 1) / 2)))def solv\u2026","title":"Project Euler 73","width":"100%","version":"1.0","author_name":"inamori","author_url":"https://blog.hatena.ne.jp/inamori/","blog_title":"inamori\u2019s diary","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20091014%2Fp2\" title=\"Project Euler 73 - 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>","provider_url":"https://hatena.blog","categories":["\u6570\u5b66","Python"],"height":"190","url":"https://inamori.hateblo.jp/entry/20091014/p2","blog_url":"https://inamori.hateblo.jp/","image_url":null}