程序题目六十个.docVIP

程序设计综合 一．编程题 1．已知斐波那契数数列：1,1,2,3,5,8,……,它可由下面公式表述： F(1)=1 n=1 F(2)=1 n=2 F(n)=F(n-1)+F(n-2) n2 试求①F(1)+F(2)+……+F(50) ；②F(52)；③100以内最大的斐波那契数？（答案：32951280098，32951280099，89） ①set talk off clear decl f(50) s=2 f(1)=1 f(2)=1 for n=3 to 50 f(n)=f(n-1)+f(n-2) s=s+f(n) endfor ?s set talk on return ②set talk off clear decl f(52) s=2 f(1)=1 f(2)=1 for n=3 to 52 f(n)=f(n-1)+f(n-2) endfor ?f(52) set talk on return  ③set talk off clear decl f(100) s=2 f(1)=1 f(2)=1 for n=3 to 100 f(n)=f(n-1)+f(n-