{"blog_url":"https://inamori.hateblo.jp/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2019%2F07%2F17%2F094859\" title=\"Julia\u3067Project Euler(4) - 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>","title":"Julia\u3067Project Euler(4)","version":"1.0","blog_title":"inamori\u2019s diary","provider_url":"https://hatena.blog","url":"https://inamori.hateblo.jp/entry/2019/07/17/094859","provider_name":"Hatena Blog","height":"190","author_url":"https://blog.hatena.ne.jp/inamori/","author_name":"inamori","image_url":null,"published":"2019-07-17 09:48:59","categories":["Julia"],"type":"rich","description":"Problem 4 https://projecteuler.net/problem=4Python\u3067\u6b21\u306e\u3088\u3046\u306b\u66f8\u304f\u3002 import sys def digits(n): ds = [] while n > 0: n, r = divmod(n, 10) ds.append(r) return ds def is_palindromic(n): ds = digits(n) L = len(ds) return all(ds[k] == ds[L-k-1] for k in xrange((L+1)/2)) def e004(E): max_a = 10**E-1 max_n = 0 for \u2026","width":"100%"}