{"width":"100%","provider_name":"Hatena Blog","blog_title":"inamori\u2019s diary","height":"190","published":"2019-07-27 20:39:53","image_url":null,"author_url":"https://blog.hatena.ne.jp/inamori/","version":"1.0","description":"Problem 14 https://projecteuler.net/problem=14Collatz\u306f\u3053\u3046\u66f8\u3051\u308b\u3002 function Collatz_length(n) len = 1 while n != 1 if n%2 == 0 n >>= 1 else n = n*3+1 end len += 1 end return len end function e014(N::Int) max_length, max_n = maximum((Collatz_length(n), n) for n in 1:N-1) return max_n end N = parse(Int, ARG\u2026","author_name":"inamori","url":"https://inamori.hateblo.jp/entry/2019/07/27/203953","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2019%2F07%2F27%2F203953\" title=\"Julia\u3067Project Euler(14) - 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>","blog_url":"https://inamori.hateblo.jp/","provider_url":"https://hatena.blog","categories":["Julia"],"title":"Julia\u3067Project Euler(14)"}