{"author_name":"troter","categories":["prolog"],"height":"190","version":"1.0","width":"100%","description":"\u826f\u5fc3\u306b\u82db\u307e\u308c\u306a\u304c\u3089\u3082\u8cbc\u308b\u3002 SICP\u306b\u3082\u4f3c\u305f\u3088\u3046\u306a\u554f\u984c\u304c\u3042\u3063\u305f\u3002SWI-Prolog\u3067\u30b0\u30ed\u30fc\u30d0\u30eb\u30b9\u30bf\u30c3\u30af\u3092\u62e1\u5f35\u3057\u3066\u5b9f\u884c\u3057\u305f\u3002 % \u30da\u30a2\u3092\u4f5c\u308b(\u304a\u307e\u3051) integer_pairs_new(PairSeed) :- PairSeed = [[[1, 1] | Tail], Tail]. integer_pairs(PairSeed, Pair, NextPairSeed) :- [Head, Tail] = PairSeed, [Pair | Rest] = Head, integer_pairs_generate_next_seed(Pair, [Rest, Tail], NextPairSe\u2026","url":"https://troter.hatenablog.jp/entry/20080506/1210071317","type":"rich","title":" project euler problem 9 answer","blog_title":"\u653e\u7267\u65e5\u8a18","published":"2008-05-06 19:55:17","image_url":null,"author_url":"https://blog.hatena.ne.jp/troter/","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftroter.hatenablog.jp%2Fentry%2F20080506%2F1210071317\" title=\" project euler problem 9 answer - \u653e\u7267\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>","blog_url":"https://troter.hatenablog.jp/","provider_name":"Hatena Blog"}