码迷,mamicode.com
首页 >  
搜索关键字:fibonacci    ( 1243个结果
Fibonacci
#include<iostream> usingnamespacestd; intmain() { intpound,p0,p1,days,result; charans; do { cout<<"Pleaseinputthepoundandthedays:\n"; cin>>pound>>days; intn=days/5; if(0==n||1==n) { result=pound; cout<<"Theresultis"<<..
分类:其他好文   时间:2014-08-26 03:12:26    阅读次数:204
杭电1848 Fibonacci again and again(博弈-打表)
Fibonacci again and again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5093    Accepted Submission(s): 2127 Problem Description 任何一个...
分类:其他好文   时间:2014-08-24 23:55:23    阅读次数:241
hdu-------(1848)Fibonacci again and again(sg函数版的尼姆博弈)
Fibonacci again and againTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5088Accepted Submission(s...
分类:其他好文   时间:2014-08-23 09:58:00    阅读次数:202
大菲波数(Fibonacci)java大数(hdu1715)
大菲波数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11520 Accepted Submission(s): 3911Problem ...
分类:编程语言   时间:2014-08-22 22:28:59    阅读次数:236
每日一小练——高速Fibonacci数算法
上得厅堂,下得厨房,写得代码,翻得围墙,欢迎来到睿不可挡的每日一小练!题目:高速Fibonacci数算法内容:先说说Fibonacci数列,它的定义是数列:f1,f2....fn有例如以下规律: 尝试寻找高速的求出fn的方法我的解法:上来没多想,打开vs2013就敲了起来,问题果然非常ea...
分类:其他好文   时间:2014-08-22 20:53:49    阅读次数:207
第四章习题:斐波那.契数列&&吸血鬼数字
package com.twoslow.cha4;/** * 斐波那契数列:从3个数字起,每一个数都是前2个数之和:1 1 2 3 5 8 13... * @author sai * */public class Fibonacci { public static void main(Stri...
分类:其他好文   时间:2014-08-21 01:35:13    阅读次数:232
斐波拉切字符串统计个数 Fibonacci String
Problem:  s0 = "a", s1 = "b", s2 = "ba", s3 = "bab", s4 = "babba", s4 = "babbabab", is called Fibonacci string. For the string with index n, given a string str = "bb", calculate how many times in the...
分类:其他好文   时间:2014-08-20 12:31:22    阅读次数:146
Fibonacci Again
Fibonacci AgainTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 8Accepted Submission(s) : 3Problem D...
分类:其他好文   时间:2014-08-19 14:28:14    阅读次数:138
广义Fibonacci数列模n的循环节
见这里:http://blog.csdn.net/ACdreamers/article/details/25616461 有详细的分析推理只找出了循环节的上限,设 f[n] = (af[n - 1] + b[n - 2])%P,设序列a ={ f[1], f[2] }, 考虑t项后, b ={ f[...
分类:其他好文   时间:2014-08-19 03:16:37    阅读次数:226
Fibonacci数列的性质
Fibonacci: 0, 1, 1, 2, 3, 5, 8, 13, .... F[0] = 0;1: gcd(Fn, Fm) = F[gcd(n, m)]; 当n - m = 1 或 2时满足,可用数学归纳法证明;2: 特征方程为 x^2 = x + 1, 类Fibonacci数列的特征方程为:...
分类:其他好文   时间:2014-08-19 00:45:13    阅读次数:350
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!