搜索资源列表
1316-How-Many-Fibs
- HDU ACM 1316 Problem Descr iption Recall the definition of the Fibonacci numbers: f1 := 1 f2 := 2 fn := fn-1 + fn-2 (n >= 3) Given two numbers a and b, calculate how many Fibonacci numbers are in the range [a, b].
jixiaozhi.rar
- 功能：用斐波那契法求f(x)在区间[a,b]上的近似极小值。当且仅当f(x)在[a,b]上为单峰时次方法适用,Function: The Fibonacci method f (x) in the interval [a, b] on the approximate minimum. If and only if f (x) in [a, b] for the single-peak method can be applied at times
Fibonacci
- 用递归算法实现，输入n后可得第n项斐波拉契数，并求出计算所用时间-Recursive algorithm, the input can be obtained after the first n n Feibolaqi item number, and extracts used in the calculation of time
Desktop
- Write a C program using the fork() system call that that generates the Fibonacci sequence in the child process. The number of the sequence will be provided in the command line. For example, if 5 is provided, the first five numbers in the Fibonacci se
sousuo
- 一维搜索法求极值的问题，用c++描述，黄金分割法和斐波那契数列发求-One-dimensional search for the extremum problem, using c++ descr iption, golden section method and the Fibonacci sequence for hair
3
- This program calculates the Fibonacci numbers via simple arithmetic operations as quickly as possible.
1029-Rabbit
- 中大oj（Sicily）1029的题目。这道题目主要是看清递归关系式而编即可。注意处理精度。本程序利用四位进位处理精度。-Problem The rabbits have powerful reproduction ability. One pair of adult rabbits can give birth to one pair of kid rabbits every month. And after m months, the kid rabbits can become adu
fib
- 汇编语言球斐波那契数列和。汇编语言程序设计-Assembly Language ball Fibonacci series and
NLP
- matlab最优化程序包括 无约束一维极值问题 进退法 黄金分割法 斐波那契法 牛顿法基本牛顿法 全局牛顿法 割线法 抛物线法 三次插值法 可接受搜索法 Goidstein法 Wolfe.Powell法 单纯形搜索法 Powell法 最速下降法 共轭梯度法 牛顿法 修正牛顿法 拟牛顿法 信赖域法 显式最速下降法-matlab optimization program includes one-dimensional extremum problem without constraint adva
gold
- MT4 指标 自动画黄金分割线 分析止损 盈利的好指标-MT4 Indicators Fibonacci-ray analysis of self-animated stop-loss profit good indicators of
number_of_fibs
- 计算满足a<=x<=b且是Fibonacci数的x个数。-Calculated to satisfy a
feibonaqieshulie
- 用递归算法设计实现的斐波那锲数列，有些地方可能不太完善-Design and Implementation of recursive algorithm using the Fibonacci series Qie, some places may not be perfect
IBM-PC
- fibonacci(c++) you can use it to prove your assemble program
java
- 用JAVA实现一个Lagged Fibonacci pseudo-random number generators (or LFGs for short)-Using JAVA realization of a Lagged Fibonacci pseudo-random number generators (or LFGs for short)
3070Fibonacci
- Pku 3070 Fabbonacci矩阵乘法解法c++代码-Pku 3070 Fabbonacci matrix multiplication method c++ Code
Kfibonacci
- K阶斐波那契数列的前K-1项均为0,第k项为1,以后的每一项都是前K项的和-K-order Fibonacci sequence of the former K-1 item are 0, the first k items for 1, after each of the items are pre-K and
shiyan1
- 编程序，使用如下所谓的简单变量“数据平移”方法来求出Fibonacci数列的第n项（的具体项值）并显示在屏幕上（正整数n通过键盘输入）：说明变量old1=1，old2=1，newItem；新的Fibonacci项newItem总是“距它最近”的前两项（old1与old2）的累加和。而后通过“old1=old2 old2=newItem ”进行所谓的“数据平移”。接着计算另一个新的Fibonacci项newItem，依次循环，直到求出数列的第n项时为止。 Fibonacci数列的计算公式如下：
1
- 汇编的斐波那契数列，本人上机作业-Compiled by the Fibonacci sequence, I am on the machine operation
shujujiegou
- 数据结构实验 如下： Status Fibonacci(int k, int m, int &f) /* 求k阶斐波那契序列的第m项的值f */-Experimental data structure is as follows: Status Fibonacci (int k, int m, int
Dijkstra
- Dijkstra算法源码，图论中求解最短路径-Dijkstra algorithm source, graph theory for solving the shortest path