搜索资源列表
Fibo
- 这个程序可以帮助你写出斐波那契数列,并且可以自我计数。可以帮助广大同学们在上课,写作业和C++ 大作业的很多忙。希望大家喜欢-This program can help you write Fibonacci series, and can be self-counting. You can help the majority of students in the class, homework and C++ big job a lo
FIB
- 计算斐波那契数列,F0=0, F1=1, Fn=Fn-1+Fn-2 (n>=2) -calculate the sequence fibonacci
Fibonacci
- 利用循环队列生成斐波那契数列的控制台程序!-Circular queue using a console program to generate Fibonacci number deed column!
java
- 判断斐波那契数列在第几项开始,值大于1000 -to decide Fibonacci sequence
Fibonacci
- 对于斐波那契数列进行运算的一个控制台应用程序,完美解决了斐波那契数列运算的结果。输入任意数字即显示对应运算结果-For Fibonacci column a console application operations, the perfect solution Fibonacci result that the number of columns lease operations. Enter any number correspon
feibonaqie
- 数据结构中,k阶斐波那契数列的实现,代码功能完整,测试没有问题。-The data structure, the realization of k order Fibonacci sequence, the code function complete, test no problem.
The-Fibonacci-sequence
- 输入一个数字N,可以显示出斐波那契数列前N项的和,C++代码-Input a number 1 to n, then output the sum of the former n unmbers in The Fibonacci sequence
Fabonacci
- 用C#编写的计算斐波那契数列的简单代码,用的控制台程序-fabonacci
Fibonacci
- 关于斐波那契数列的几种计算方法,在JSP中的进行实现的是小于100的计算。-About several calculation methods of the Fibonacci sequence, implemented in JSP is less than 100.
Fibonacci-sequence
- 用C语言实现的斐波那契数列,可以输入数字,产生相应阶的斐波那契数列。-Using C language implementation of the Fibonacci sequence, you can enter the number, generates the corresponding order Fibonacci sequence.
devide-the-chocolate
- 儿童节快到了,班长想要给班上的每个同学给一个巧克力,巧克力的形状是一个宽为2,长为n的长方形,由于巧克力太贵,班长就想把这个大块的巧克力分成许多 1*2(宽*长)的小块巧克力,这样每个人都能得到一份1*2的巧克力,现在给定巧克力的长为正整数n(1<=n<=91),请你判断对于这个2*n的巧克力有多少种不同的分法? 这道题考察的是斐波那契数列。-Children' s Day is coming, the squ
fac
- 用约分实现40以内的Cmn排列组合,并利用排列组合公式实现斐波那契数列的输出。-With about 40 minutes to achieve within Cmn permutations, permutations and combinations and the use of the formula to achieve an output that Fibonacci number Fibonacci sequence.
Fibonacci
- C++实现的关于斐波那契数列的求和问题。-about Fibonacci
fibonacci
- 斐波那契数列,可在区间内输出区间内的斐波那契数列。-It is a fibonacci series.
lab02
- f(n)=f(n-1)+f(n-2) f(0)=f(1)=1,求斐波那契数列第20项,分别用循环和递归的方式,比较时间效率。提示:可以使用c函数clock取出当前系统时间,计算前后各一次,两次相减除以每秒的时钟数,就可以得到以秒为单位的差距-f (n) = f (n-1)+ f (n-2) f (0) = f (1) = 1, Item 20 seeking Fibonacci number Fibonacci sequence tha
12101
- 斐波那契数列通项公式,最简单的一种写法,谨献给VB初学者。-Fibonacci Sequence formula, the easiest way to write, I would like to dedicate VB beginners.
13100
- 斐波那契数列的前N项和,最简单的一种写法,谨献给VB初学者。-The first N Fibonacci series, the easiest way to write, I would like to dedicate VB beginners.
Fibonacci-sequence
- 递归调用产生斐波那契数列和循环产生斐波那契数列的效率的比对,输入要产生的斐波那契数列的位数-Recursive call produces Fibonacci sequence and cycling Fibonacci series comparing the efficiency of input to generate Fibonacci sequence of digits
Fibonacci
- 通过模板类,获取斐波那契数列任意位的数,还可以修改成任意数列的类-By the template class, gets the Fibonacci sequence any number of bits can also be modified into an arbitrary sequence of classes
Fibonacci
- 该程序实现了经典的斐波那契数列的功能,欢迎学习-fabonacci numbers