摘要:
fibonacci数列(二)时间限制:1000 ms | 内存限制:65535 KB难度:3描述In the Fibonacci integer sequence,F0= 0,F1= 1, andFn=Fn− 1+Fn− 2forn≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative formula for the Fibonacci sequence is.Given an integern, your goal 阅读全文
posted @ 2013-04-14 10:16
heity
阅读(252)
评论(0)
推荐(0)

浙公网安备 33010602011771号