题目:
斐波纳契数列是这样的数列:
f1 = 1
f2 = 1
f3 = 2
f4 = 3
....
fn = fn-1 + fn-2
输入一个整数n
求fn
代码:
var f:array [0..50] of longint; n,i:longint; begin readln(n); f[1]:=1;f[2]:=1; for i:=3 to n do f[i]:=f[i-1]+f[i-2]; write(f[n]); end.
转载请注明原文地址: https://ju.6miu.com/read-660626.html