搜索资源列表
fibonacci
- 经典的斐波那契数列算法，使用c++语言编写。希望对大家有用-Classic Fibonacci sequence algorithm, using c++ language. Want to be useful to everyone
suanfa
- 算法的试验报告 包括斐波那契数列问题（内涵流程图等等）-Test report including algorithm Fibonacci sequence
Fibonacci
- 可以实现大整数斐波那契数列元素的输出，输入元素序号，输出整数-Can achieve large integer Fibonacci sequence elements in the output, input element number, output integer
Fibo
- 用循环实现斐波那契数列，输入位置，输出数字~~不过不要用太大的位置哟，你的本本会崩溃的~_~-Achieved by circulating Fibonacci series, enter the location, the output figures do not use too much ~ ~ but the location of yo, your books will collapse ~ _ ~
fib
- 实现斐波那契数列求和及显示，分别输入要测试的次数，并输入要求和的前几项，屏幕上就能显示要求的和，并给你你要求的次数-Fibonacci series to achieve the sum and show, respectively, enter the number you want to test and enter the first few requirements and on the screen and can display requirements and give you t
FIBONACCI
- 将斐波那契数列表示出来，并将产生的数列进行分析操作，源代码-Fibonacci series, the source code
fpnq
- 斐波那契数列，输入一个数字n，输出斐波那契数列中大于等于n的第一个数字，并指明该数字是第几个数字。 例如输入数字10；应该指出斐波那契数列中大于等于n的第一个数字为13，该数字在数列中为第7个数字-Fibonacci series, enter a number n, the output in the Fibonacci series is equal to n is greater than the first number, and indicate the number is the
yuandai
- mp3解析，斐波那契数列，计算单词数，计算器，内存-mp3 resolution, the Fibonacci series, calculate the number of words, calculators, memory
12
- 斐波那契数列通项公式，最简单的一种写法，谨献给VB初学者。-Fibonacci Sequence formula, the easiest way to write, I would like to dedicate VB beginners.
13
- 斐波那契数列的前N项和，最简单的一种写法，谨献给VB初学者。-The first N Fibonacci series, the easiest way to write, I would like to dedicate VB beginners.
输出斐波那契数列前 n项
- 通过输入数值n,输出斐波那契数列前 n项(Through the numerical input n, output Fibonacci numbers before the n)
韩信点兵
- 验证斐波那契数列 波波各方面各式各样特vjjfulj规范国家规定下雨(fdb sd fngn etf dbd db tbgf vxf erv dt yth)
菲波那契数列
- //指的是这样一个数列： 1，1，2，3，5，8，13，21…… //这个数列从第三项开始，每一项都等于前两项之和(refers to such a sequence: 1, 1, 2, 3, 5, 8, 13, 21...... This series from the beginning of the third /, each of which is equal to the sum of the preceding two terms)
Fibonacci Numbers
- 用C++函数对斐波那契数列进行求解，入门级算法，适合掌握(In c + + function to solve the Fibonacci sequence, entry-level algorithm, suitable for control)
fibo
- 斐波那契数列,简单地说,起始两项为0和1,此后的项分别为它的前两项之后。本算法使用递归算法实现。(The Fibonacci sequence, simply said, starting two to 0 and 1, then were the top two after it. This algorithm is implemented by recursive algorithm.)
斐波那契数
- 斐波那契数，能够求1-n的斐波那契数列以及时间，通过输入一个数值n，即可从1-n输出数列和所需时间。(Fibonacci, can 1-N the Fibonacci sequence and time, through a numerical input n can be output from the 1-n sequence and the time required.)
斐波那契数列
- 能够实现斐波那契数列，阿特姆郎数和汉诺塔游戏步骤的产生，用PYTHON语言编写，简介实用(Which can realize the Fibonacci sequence)
Desktop
- 斐波那契数是0、1、1、2、3、5、8、13、21，用递归方法可以定义为F0=0，F1=1，Fn=F(n-1)+F(n-2)（n>=2，n∈N*），此程序作用为算出第n个斐波那契数的数值并输出(Calculate the n value and output Fibonacci number)
斐波那契数列用循环队列解决
- 本代码提供将斐波那契数列用循环队列来解决的方案。(This code provides a solution to the Fibonacci sequence using a circular queue.)
斐波那契数列
- c语言解决斐波那契数列问题，本科远古代码