Location:
Search - Fibonacci 30
Search list
Description: 数据结构的生成Fibonacci数列和下三角的例子-data structure formation and the Fibonacci series of examples under 1.30
Platform: |
Size: 33113 |
Author: qzhirong |
Hits:
Description: 数据结构的生成Fibonacci数列和下三角的例子-data structure formation and the Fibonacci series of examples under 1.30
Platform: |
Size: 32768 |
Author: qzhirong |
Hits:
Description: Pku 3070 Fabbonacci矩阵乘法解法c++代码-Pku 3070 Fabbonacci matrix multiplication method c++ Code
Platform: |
Size: 1024 |
Author: ed |
Hits:
Description: 曾被评为 20 世纪 30 本顶尖计算机著作之一。本版（第二版）特点：专用两章分别讨论了算法设计技巧与摊还分析、介绍了当前流行论题（如斐波那契堆）等-Has been rated as the 20th century, 30 one of the top computer book. Edition (second edition) features: dedicated two chapters discuss the analysis of algorithm design techniques and amortization, on the current popular topics (such as Fibonacci heaps), etc.
Platform: |
Size: 11592704 |
Author: 清风 |
Hits:
Description: 输入 20~30之间的n 值, 用递归计算 Fibonacci 数, 以十进制数输出.-Enter between 20 to 30 n values, calculated using recursive Fibonacci numbers to decimal output.
Platform: |
Size: 8192 |
Author: wulin |
Hits:
Description: 1.编写递归函数计算Fibonacci数列，能避免重复计算
输入：input.txt，仅包含一个整数n（0－90）
输出：程序应能检查输入合法性，若有错误，输出错误提示“WRONG”；否则输出F(n)。两种情况都输出一个回车（形成一个空行）。所有实例均应在30秒内输出结果。
提示：可用一数组保存Fibonacci数列，用一个特殊值表示还未计算出Fibonacci数，递归调用前先检查数组，若已计算，直接取用，不进行递归调用；若未计算，调用递归函数，计算完成后保存入数组。实际上，这种方法得到了F(1)－F(n)，而不仅是F(n)。
另外，注意数据类型取值范围问题。VC 6.0中，长整型为LONGLONG，而其输出用 I64d。
-Write a recursive function calculation Fibonacci sequence, to avoid double counting input: input.txt contains only an integer n (0-90) output: the program should be able to check the input legitimacy, any errors in the output error " WRONG" Otherwise, output F (n). In both cases, output a carriage return (form a blank line). All instances should be within 30 seconds to output the result. Tip: available an array to save the Fibonacci sequence, with a special value that has not yet calculated the Fibonacci numbers, before the recursive call to check array, if you calculate, direct access to the recursive call if not calculated to call recursive function to calculate completed and saved into the array. In fact, this approach has been the F (1)-F (n), not only is F (n). In addition, note that the range of data types. VC 6.0, long integer LONGLONG, its output I64d.
Platform: |
Size: 1024 |
Author: 张蕊 |
Hits:
Description: 求斐波那契数列第n项，n<30，斐波那契数列前10项为 1,1,2,3,5,8,13,21,34,-O the Fibonacci sequence n, n < 30, before the Fibonacci sequence,1,2,3,5,8,13,21,34,55 10 to 1
Platform: |
Size: 1024 |
Author: 王大可 |
Hits:
Description: Fibonacci数列的特点是第1，2两个数为1，1。从第3个数开始，该数是前两个数之和。求这个数列的前30个元素。-Fibonacci sequence is characterized by two numbers 1,2 1,1. The first three numbers from the beginning, the number and the sum of the first two. 30 elements before seeking this series.
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 这种递归形式的定义容易诱导人们使用递归形式来解决问题。这里有一个陷牌：它使用递归步骤计算Fibonacci(n-1)和Fibonacci(n-2)。但是，在计算Fibonacci(n-1)时也将计算Fibonacci(n-2)。这个额外的计算代价有多大呢？
它的代价远远不止一个冗余计算：每个递归调用都触发另外两个递归调用，而这两个调用的任何一个还将触发两个递归调用，再接下去的调用也是如此。这样，冗余计算的数量增长得非常快。例如，在递归计算Fibonacci(10)时，Fibonacci(3)的值被计算了21次。但是，在递归计算 Fibonacci(30)时，Fibonacci(3)的值被计算了317811次。当然，这317811次计算所产生的结果是完全一样的，除了其中之一外，其余的纯属浪费。这个额外的开销真是相当恐怖！
如果使用一个简单循环来代替递归，这个循环的形式肯定不如递归形式符合前面菲波那契数的抽象定义，但它的效率提高了几十万倍！
当你使用递归方式实现一个函数之前，先问问你自己使用递归带来的好处是否抵得上它的代价。 而且你必须小心：这个代价可能比初看上去要大得多。-Using a recursive Fibonacci number
Platform: |
Size: 1024 |
Author: 钟晨阳 |
Hits:
Description: 输入 20~30之间的n 值, 用递归计算 Fibonacci 数, 以十进制数输出.-Enter n values between 20 to 30, using recursive calculation of Fibonacci numbers to decimal number.
Platform: |
Size: 1024 |
Author: 俞溯 |
Hits:
Description: EURUSD刷单策略 ，根据斐波那契回调线进行入场，在压力或支撑处有加仓（加仓次数及手数可控），根据当前K线的动率和速率的大小进行加仓，有了本EA基本可无视任何大数据行情。 此系统不会在大阳线或大阴线形成的中途“密集加仓”，只会在价格出现滞涨或止跌时加仓，由于是加仓型，故在一个单边行情中，价格只需要回撤20-30%时，就会止盈离场！不会存在抗单几周到几个月的情况。
对于马丁类的EA来说，重要的应该是EA的参数配置；另外就是人为的控制入场！给予它最大的信心，根据入场选择合适的参数。(Eurussd order brushing strategy: admission is conducted according to Fibonacci callback line, and positions are increased at the pressure or support (the number of positions and hands can be controlled), and the positions are increased according to the current rate and speed of K line. With this EA, any big data market can be ignored. This system will not "intensively add positions" in the middle of the formation of the big positive line or the big Yin line, but will increase the position when the price rises or stops falling. Because it is a position increase type, in a unilateral market, when the price only needs to withdraw 20-30%, it will stop the profit and leave the market! There won't be a few weeks to a few months of resistance.
For Martin class EA, the important thing should be the configuration of EA parameters; in addition, it is artificially controlled admission! Give it the greatest confidence and choose the right parameters according to the admission)
Platform: |
Size: 78848 |
Author: 成衣成 |
Hits: