{"image_url":null,"provider_name":"Hatena Blog","description":"Problem 25 https://projecteuler.net/problem=25 function add(v1, v2) if length(v1) > length(v2) return add(v2, v1) end v3::Array{Int} = [] carry = 0 for k in 1:length(v1) n = v1[k] + v2[k] + carry carry = div(n, 10) d = n % 10 push!(v3, d) end for l in length(v1)+1:length(v2) n = v2[l] + carry carry \u2026","title":"Julia\u3067Project Euler(20)","published":"2019-08-02 08:20:53","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2019%2F08%2F02%2F082053\" title=\"Julia\u3067Project Euler(20) - 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_title":"inamori\u2019s diary","categories":["Julia"],"provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/inamori/","height":"190","blog_url":"https://inamori.hateblo.jp/","version":"1.0","author_name":"inamori","url":"https://inamori.hateblo.jp/entry/2019/08/02/082053","type":"rich"}