{"title":"Project Euler 53","published":"2009-04-30 00:00:01","height":"190","author_url":"https://blog.hatena.ne.jp/inamori/","provider_name":"Hatena Blog","image_url":null,"url":"https://inamori.hateblo.jp/entry/20090430/p2","provider_url":"https://hatena.blog","categories":["\u6570\u5b66","Python"],"blog_title":"inamori\u2019s diary","author_name":"inamori","type":"rich","version":"1.0","description":"\u30d7\u30ed\u30b8\u30a7\u30af\u30c8\u30aa\u30a4\u30e9\u30fc http://projecteuler.net/index.php Q53. nCr(1\u2264n\u2264100)\u306e100\u4e07\u3092\u8d85\u3048\u308b\u9805\u306e\u500b\u6570 \u3075\u3064\u3046\u306b\u3084\u308b\u3068\u3001\u3053\u3046\u3002 from math import factorialdef combination(n, r): return factorial(n) / factorial(r) / factorial(n - r)N = 100 M = 1000000 counter = 0 for n in range(1, N + 1): for r in range(0, n + 1): if combination(n, r) > M: \u2026","width":"100%","blog_url":"https://inamori.hateblo.jp/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20090430%2Fp2\" title=\"Project Euler 53 - 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>"}