{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2019%2F07%2F22%2F102522\" title=\"Julia\u3067Project Euler(9) - 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>","type":"rich","categories":["Julia"],"url":"https://inamori.hateblo.jp/entry/2019/07/22/102522","provider_name":"Hatena Blog","width":"100%","height":"190","title":"Julia\u3067Project Euler(9)","image_url":"https://chart.apis.google.com/chart?cht=tx&chl=%20a%20%3D%20l%28m%5E2-n%5E2%29%2C%20b%20%3D%202lmn%2C%20c%20%3D%20l%28m%5E2%2Bn%5E2%29","blog_title":"inamori\u2019s diary","blog_url":"https://inamori.hateblo.jp/","published":"2019-07-22 10:25:22","author_name":"inamori","description":"Problem 9 https://projecteuler.net/problem=9\u30d4\u30bf\u30b4\u30e9\u30b9\u6570\u306f\u4e00\u822c\u306b\u3001\u3068\u66f8\u3051\u308b\uff08m\u3068n\u306f\u4e92\u3044\u306b\u7d20\u3067\u3069\u3061\u3089\u304b\u304c\u5076\u6570\u3067\u3001\uff09\u3066\u3001\u76f4\u89d2\u4e09\u89d2\u5f62\u306e\u5468\u56f2\u306e\u9577\u3055\u306f\u3068\u306a\u308b\u306e\u3067\u3001\u5468\u56f2\u306e\u9577\u3055/2\u30922\u3064\u306e\u7d04\u6570\u306b\u5206\u3051\u3066\u3001\u3055\u3089\u306b\u305d\u306e\u4e00\u65b9\u30922\u3064\u306e\u7d04\u6570\u306b\u5206\u3051\u308b\u5fc5\u8981\u304c\u3042\u308b\u304c\u3001m\u3068m+n\u304c\u4e92\u3044\u306b\u7d20\u306a\u306e\u3092\u5229\u7528\u3059\u308b\u3068\u3001\u4f59\u5206\u306a\u8a08\u7b97\u3092\u3057\u306a\u304f\u3066\u6e08\u3080\u3002 function factorize_naive(n) fs = Dict() for d in Iterators.countfrom(2) if d*d > n break elseif n%d == 0 e = 1 n = div(n, d) w\u2026","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/inamori/","version":"1.0"}