{"published":"2019-07-18 08:48:51","title":"Julia\u3067Project Euler(5)","image_url":null,"type":"rich","version":"1.0","categories":["Julia"],"author_name":"inamori","author_url":"https://blog.hatena.ne.jp/inamori/","provider_url":"https://hatena.blog","width":"100%","blog_url":"https://inamori.hateblo.jp/","blog_title":"inamori\u2019s diary","description":"Problem 5 https://projecteuler.net/problem=5Python\u3067\u6b21\u306e\u3088\u3046\u306b\u66f8\u304f\u3002 from fractions import gcd import sys def lcm(n, m): return n/gcd(n, m)*m def e005(n): return reduce(lcm, range(1, n+1), 1) N = int(sys.argv[1]) print e005(N) \u3053\u308c\u3092\u305d\u306e\u307e\u307eJulia\u306b\u7ffb\u8a33\u3059\u308b\u3002 function lcm(n, m) return div(n, gcd(n, m))*m end function e005\u2026","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2019%2F07%2F18%2F084851\" title=\"Julia\u3067Project Euler(5) - 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","url":"https://inamori.hateblo.jp/entry/2019/07/18/084851"}