{"author_name":"inamori","type":"rich","blog_url":"https://inamori.hateblo.jp/","author_url":"https://blog.hatena.ne.jp/inamori/","width":"100%","blog_title":"inamori\u2019s diary","title":"Julia\u3067Project Euler(18)","image_url":null,"version":"1.0","published":"2019-07-31 08:47:00","categories":["Julia"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2019%2F07%2F31%2F084700\" title=\"Julia\u3067Project Euler(18) - 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>","height":"190","provider_url":"https://hatena.blog","provider_name":"Hatena Blog","description":"Problem 20 https://projecteuler.net/problem=20Problem16\u3068\u3060\u3044\u305f\u3044\u540c\u3058\u3002Python\u3067\u66f8\u304f\u3068\u3001 from itertools import * import sys def multiply(v, n): v2 = [] carry = 0 for d in v: carry, r = divmod(d*n+carry, 10) v2.append(r) while carry > 0: carry, r = divmod(carry, 10) v2.append(r) return v2 def e020(N): a = [1] for \u2026","url":"https://inamori.hateblo.jp/entry/2019/07/31/084700"}