摘要: 巨大的斐波那契数 The i'th Fibonacci number f (i) is recursively defined in the following way: f (0) = 0 and f (1) = 1 f (i+2) = f (i+1) + f (i) for every i ≥  阅读全文
posted @ 2016-04-25 11:46 枫虹 阅读(229) 评论(0) 推荐(0)