{"title":"Scheme\uff08Gauche\uff09\u3067\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u5217","type":"rich","blog_title":"Camera Obscura","version":"1.0","url":"https://obelisk.hatenablog.com/entry/2016/08/19/041632","height":"190","author_name":"obelisk2","image_url":null,"width":"100%","blog_url":"https://obelisk.hatenablog.com/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fobelisk.hatenablog.com%2Fentry%2F2016%2F08%2F19%2F041632\" title=\"Scheme\uff08Gauche\uff09\u3067\u30d5\u30a3\u30dc\u30ca\u30c3\u30c1\u6570\u5217 - Camera Obscura\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","description":"\u3053\u3093\u306a\u611f\u3058\u3067\u3057\u3087\u3046\u304b\u3002 (define (sub a b co n) (if (= co n) a (begin (print a) (sub (+ a b) a (+ co 1) n)))) (define (fibonatti n) (print (sub 1 1 1 n))) (fibonatti 10) Scheme \u3063\u3066 while \u6587\u3082 for \u6587\u3082\u306a\u3044\u306e\u3067\u3059\u306d\u3002\u7e70\u308a\u8fd4\u3057\u306f do \u6587\u3067\u3084\u308b\u304b\u3001\u518d\u5e30\u3092\u4f7f\u3046\u3068\u3002\u4e0a\u306f\u6b21\u306e Ruby \u30b3\u30fc\u30c9\u3068\u540c\u7b49\u3067\u3059\u3002 def sub(a, b, co, n) return a if co == n puts a sub(a + b, a, co + 1,\u2026","provider_url":"https://hatena.blog","provider_name":"Hatena Blog","published":"2016-08-19 04:16:32","author_url":"https://blog.hatena.ne.jp/obelisk2/","categories":["Lisp"]}