{"author_name":"mzp","title":"Problem25","url":"https://mzp.hatenadiary.org/entry/20080501/fibs","categories":["Python","30\u5206\u30d7\u30ed\u30b0\u30e9\u30e0"],"provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmzp.hatenadiary.org%2Fentry%2F20080501%2Ffibs\" title=\"Problem25 - \u307f\u305a\u3074\u30fc\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","published":"2008-05-01 00:00:00","author_url":"https://blog.hatena.ne.jp/mzp/","description":"30\u5206\u30d7\u30ed\u30b0\u30e9\u30e0\u3001\u305d\u306e296\u3002Problem25 via ProjectEuler\u3002 \u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u5217\u306f\u4ee5\u4e0b\u306e\u6f38\u5316\u5f0f\u3067\u5b9a\u7fa9\u3055\u308c\u308b: F(n) = F(n-1) + F(n-2), \u305f\u3060\u3057 F(1) = 1, F(2) = 1.\u6700\u521d\u306e12\u9805\u306f\u4ee5\u4e0b\u3067\u3042\u308b. F(1) = 1 F(2) = 1 F(3) = 2 F(4) = 3 F(5) = 5 F(6) = 8 F(7) = 13 F(8) = 21 F(9) = 34 F(10) = 55 F(11) = 89 F(12) = 144 12\u756a\u76ee\u306e\u9805, F12\u304c3\u6841\u306b\u306a\u308b\u6700\u521d\u306e\u9805\u3067\u3042\u308b. 1000\u6841\u306b\u306a\u308b\u6700\u521d\u306e\u9805\u306e\u756a\u53f7\u3092\u7b54\u3048\u3088. \u6700\u521d\u306fPerl\u3067\u2026","blog_title":"\u307f\u305a\u3074\u30fc\u65e5\u8a18","version":"1.0","width":"100%","height":"190","type":"rich","image_url":null,"provider_url":"https://hatena.blog","blog_url":"https://mzp.hatenadiary.org/"}