{"version":"1.0","published":"2008-10-27 23:45:24","categories":["Project Euler"],"height":"190","author_name":"jeneshicc","author_url":"https://blog.hatena.ne.jp/jeneshicc/","width":"100%","provider_url":"https://hatena.blog","image_url":null,"provider_name":"Hatena Blog","description":"Starting in the top left corner of a 2x2 grid, there are 6 routes (without backtracking) to the bottom right corner. How many routes are there through a 20x20 grid? Integer\u3092\u4f7f\u3048\u3070\u7c21\u5358\u3002 p015 n = product[n+1..2*n]`div`product[1..n]","blog_url":"https://jeneshicc.hatenadiary.org/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081027%2F1225118724\" title=\"Problem 15 - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" 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","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","title":"Problem 15","url":"https://jeneshicc.hatenadiary.org/entry/20081027/1225118724"}