{"height":"190","version":"1.0","published":"2019-07-25 09:20:20","blog_title":"inamori\u2019s diary","type":"rich","blog_url":"https://inamori.hateblo.jp/","description":"Problem 12 https://projecteuler.net/problem=12\u672c\u5f53\u306f\u901f\u3044\u65b9\u6cd5\u304c\u3042\u308b\u304c\u3001\u3053\u3053\u3067\u306f\u611a\u76f4\u306b\u9806\u756a\u306b\u7d04\u6570\u306e\u500b\u6570\u3092\u8abf\u3079\u3066\u3044\u304f\u3002 function factorize_naive(n) fs = [] for d in Iterators.countfrom(2) if d*d > n break elseif n%d == 0 e = 1 n = div(n, d) while n%d == 0 e += 1 n = div(n, d) end push!(fs, Pair(d, e)) end end if n != 1 push!(fs, Pair(n, \u2026","width":"100%","author_name":"inamori","provider_name":"Hatena Blog","url":"https://inamori.hateblo.jp/entry/2019/07/25/092020","title":"Julia\u3067Project Euler(12)","author_url":"https://blog.hatena.ne.jp/inamori/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2019%2F07%2F25%2F092020\" title=\"Julia\u3067Project Euler(12) - 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>","provider_url":"https://hatena.blog","image_url":null,"categories":["Julia"]}