{"version":"1.0","title":"Problem 012","author_url":"https://blog.hatena.ne.jp/fortran66/","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ffortran66.hatenablog.com%2Fentry%2F20121229%2F1356772157\" title=\"Problem 012 - fortran66\u306e\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"blog_url":"https://fortran66.hatenablog.com/","published":"2012-12-29 18:09:17","author_name":"fortran66","type":"rich","categories":["ProjectEuler"],"blog_title":"fortran66\u306e\u30d6\u30ed\u30b0","height":"190","url":"https://fortran66.hatenablog.com/entry/20121229/1356772157","provider_name":"Hatena Blog","width":"100%","description":"i\u756a\u76ee\u306e\u4e09\u89d2\u6570\u306f i(i+1)/2 \u7d20\u56e0\u6570\u5206\u89e3\u306f i, i+1, 2 \u306b\u3064\u3044\u3066\u3084\u3063\u3066\u8db3\u3057\u5f15\u304d\u3059\u308b\u3002\u7d04\u6570\u306e\u6570\u306f\u7d20\u56e0\u6570\u306b1\u8db3\u3057\u3066\u7a4d\u3002 \u30bd\u30fc\u30b9\u30fb\u30d7\u30ed\u30b0\u30e9\u30e0 program PEuler012 implicit none integer :: i, k1, k2, n integer, allocatable :: ipfac(:), ipfac0(:), ipfac1(:) i = 1 ipfac0 = [integer::] do ipfac1 = ipfactor(i + 1) k1 = size(ipfac0) k2 = size(ipfac1) if (k1 > k2) then ipfac\u2026"}