搜索资源列表
-
0下载：
利用动态规划方法实现求解斐波那契序列，利用数组存储重复使用的中间结果，提供程序运行的效率-Using dynamic programming method to solve the Fibonacci sequence
-
-
0下载：
In mathematics, the Fibonacci sequence is the following infinite sequence of natural numbers:
The first element is 0, the second is 1 and each remaining element is the sum of the previous two:
Each element of this sequence is called F
-
-
0下载：
已知斐波那契数列的定义：F(1)=1,F(2)=1,F(i)= F(i-1)+ F(i-2) (i>=3),编写求该数列前n项的子程序
实现了输入一个数，然后将计算的结果保存在存储器中-Known Fibonacci sequence definition: F (1) = 1, F (2) = 1, F (i) = F (i-1)+ F (i-2) (i> = 3), preparation for the series before the n of the subrout
-
-
0下载：
斐波那契数列，包含头文件、算法实现文件及主函数文件。 -Fibonacci sequence, including the header files, the algorithm to achieve the main function of documents and files.
-
-
0下载：
该为使用stl处理的fibonacci序列，能够计算
出任意规模下的fibonacci序列-The handle for the use of stl Fibonacci sequence, can be calculated under the arbitrary scale Fibonacci Sequence
-
-
0下载：
本程序演示的是一个K阶斐波那契序列实例，在程序运行中输入斐波那契的阶数为4，在序列中允许的最大数为3.-This procedure is a demonstration of the K-order Fibonacci sequence example, type in the program to run the order Fibonacci number 4, sequence at the maximum allowable number of 3.
-
-
0下载：
经典的斐波那契数列算法，使用c++语言编写。希望对大家有用-Classic Fibonacci sequence algorithm, using c++ language. Want to be useful to everyone
-
-
0下载：
Fibonacci数列的递归和非递归算法，有详细注释-Fibonacci sequence of recursive and non-recursive algorithm, detailed notes
-
-
0下载：
Fibonacci Sequence VHDL code.
-
-
0下载：
可以输入任意一个数字n，能在电脑上显示出第n个斐波那契序列。-You can enter any number n, the n-th Fibonacci sequence is displayed on the computer.
-
-
0下载：
3. 利用虚函数手段，按照3种不同的计算方法来求出Fibonacci数列的第n项（的具体项值）并输出。-3 by means of virtual functions, n terms of the Fibonacci sequence (the specific items of value) and output is obtained in accordance with the different calculation methods.
-
-
0下载：
递归调用产生斐波那契数列和循环产生斐波那契数列的效率的比对，输入要产生的斐波那契数列的位数-Recursive call produces Fibonacci sequence and cycling Fibonacci series comparing the efficiency of input to generate Fibonacci sequence of digits
-
-
0下载：
斐波那契数列递归,采用c语言编写,注释齐全-Recursive Fibonacci sequence, using c language, complete notes
-
-
0下载：
此程序为C++语言的程序，可以输出斐波那契数列，特点是采用线性表的数据结构处理加法运算，对每一位数进行运算，并进位，解决了由于int或long int甚至unsigned long int(0~2^32-1=4294967295)的精度范围限制，此算法的精度范围主要受项数n(int)的范围(1~2^31-1=2147483647)影响-This program is C++ language program, you can output the Fibonacci sequence, is c
-
-
0下载：
输入一个数字N，可以显示出斐波那契数列前N项的和，C++代码-Input a number 1 to n, then output the sum of the former n unmbers in The Fibonacci sequence
-
-
0下载：
用C语言实现的斐波那契数列，可以输入数字，产生相应阶的斐波那契数列。-Using C language implementation of the Fibonacci sequence, you can enter the number, generates the corresponding order Fibonacci sequence.
-
-
0下载：
斐波那契数列指的是这样一个数列：1、1、2、3、5、8、13、21、34……
这个数列从第三项开始，每一项都等于前两项之和。
给出一个正整数n，要求菲波那契数列中第n个数是多少。
-
Fibonacci sequence refers to such a series: 1,1,2,3,5,8,13,21,34 ......
This sequence begins with the third term, each equal to the sum of the
-
-
0下载：
斐波那契数列f(n)满足以下定义：
f(0) = 1, f(1) = 1, f(n) = f(n-1) + f(n-2) (n >= 2)。
本题的数据规模比原先更大
输入描述
每行输入一个整数 n
0 <= n<= 80
输出描述
对于每一行输入，输出斐波那契数列第n项的值f(n)(Fibonacci sequence f(0) = 1, f(1) = 1, f(n) = f(n-1) + f(n-2) (n >= 2))
-
-
0下载：
Fibonacci Sequence Generator Using C
-
-
0下载：
基于队列设计算法，输出任意位置的Fibonacci 数列元素值。
fib(0) = 1
fib(1) = 1
fib(n) = fib(n-1)+fib(n-2)(Based on the queue design algorithm, the Fibonacci sequence element value of any location is output.)
-
