文件名称:fibonacci
介绍说明－－下载内容均来自于网络，请自行研究使用
The fi rst fi bonacci number is defi ned as 0. The second is defi ned as 1. The remaining are defi ned as
the sum of the two previous. (And as usual “the fi rst” start counting on 0.) This gives the following
recursive formula:
f (0) = 0
f (1) = 1
f (n) = f (n-1) + f (n-2)
the sum of the two previous. (And as usual “the fi rst” start counting on 0.) This gives the following
recursive formula:
f (0) = 0
f (1) = 1
f (n) = f (n-1) + f (n-2)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
fibonacci\bin\Debug\fibonacci.exe
.........\fibonacci.cbp
.........\fibonacci.depend
.........\fibonacci.layout
.........\main.cpp
.........\main.exe
.........\main.o
.........\obj\Debug\main.o
.........\bin\Debug
.........\obj\Debug
.........\bin
.........\obj
fibonacci