搜索资源列表
-
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下载：
该为使用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下载：
efective way to generate "fibonacci" without rekurency - generates numbers from fibonacci sequence - (natural numbers)-efective way to generate "fibonacci" without rekurency- generates numbers from fibonacci sequence- (natural numbers)
-
-
0下载：
取石子游戏之必胜策略
采用斐波那契数列作为算法-The winning strategy game to take stones used Fibonacci sequence as an algorithm
-
-
0下载：
Fibonacci数列的递归和非递归算法，有详细注释-Fibonacci sequence of recursive and non-recursive algorithm, detailed notes
-
-
0下载：
The Fibonacci sequence written in C++.
I used DevC to develop, compile and run the code.
Project files are included.
-
-
0下载：
斐波那契数列1，1，2，3，5，8，13，21……的通项公式，其中a(n+2)= a(n+1)+an
注括号内为下标。-Fibonacci sequence 1,1,2,3,5,8,13,21 ... ... The general formula, where a (n+2) = a (n+1)+ an injection subscr ipt brackets.
-
-
0下载：
4阶斐波那契序列如下：f0=f1=f2=0, f3=1,…,fi=fi-1+fi-2+fi-3+fi-4，
利用容量为k=4的循环队列，构造序列的前n+1项（f0, f1 , f2 ,… fn ），要求满足fn ≤200而fn+1 >200。
-4-order Fibonacci sequence is as follows: f0 = f1 = f2 = 0, f3 = 1, ..., fi = fi-1+ fi 2+ fi-3+ fi-4,
With size k = 4
-
-
0下载：
利用递归算法计算斐波那契数列的n项的值，-Recursive algorithm to calculate the Fibonacci series, the value of n items
-
-
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下载：
Fibonacci数列(高精度算法）
Input
有多行，每行代表一个正整数n（1 ≤ n ≤ 1001）。
Output
对每个输入，输出Fibonacci数列的第n项。-Fibonacci sequence (precision arithmetic)
-
-
0下载：
利用递归产生斐波那契数列的一个小程序。希望能有帮助-Recursive Fibonacci sequence produces a small program.Hope can be helpful.
-
-
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下载：
采用矩阵法求斐波那契数列，求解fac(n) 100000，其中n为大于等于3的正整数-Matrix method to the Fibonacci sequence
-
-
0下载：
斐波那契数列Fibonacci Sequence的Java语言呈现-Fibonacci number Fibonacci sequence Java language presentation
-
-
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下载：
基于队列设计算法，输出任意位置的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.)
-
