{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2019%2F07%2F28%2F194111\" title=\"Julia\u3067Project Euler(15) - 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>","version":"1.0","width":"100%","blog_title":"inamori\u2019s diary","type":"rich","description":"Problem 15 https://projecteuler.net/problem=15DP\u3067\u89e3\u304f\u3002 function e015(N) a = zeros(Int, N+1, N+1) a[1,1] = 1 for x in 2:N+1 a[1,x] = 1 end for y in 2:N+1 a[y,1] = 1 end for y in 2:N+1 for x in 2:N+1 a[y,x] = a[y,x-1] + a[y-1,x] end end return a[N+1,N+1] end N = parse(Int, ARGS[1]) println(e015(N)) Juli\u2026","author_url":"https://blog.hatena.ne.jp/inamori/","title":"Julia\u3067Project Euler(15)","published":"2019-07-28 19:41:11","provider_name":"Hatena Blog","url":"https://inamori.hateblo.jp/entry/2019/07/28/194111","image_url":null,"height":"190","blog_url":"https://inamori.hateblo.jp/","author_name":"inamori","categories":["Julia"],"provider_url":"https://hatena.blog"}