递推方程
兔蠢蠢
这个作者很懒,什么都没留下…
展开
-
NEFU 461 fibs的位数()
fibs的位数 Problem:461Time Limit:1000msMemory Limit:65536KDescription 广义的Fibonacci数列定义如下:R0=a; R1= b; Rn= uRn-1 + vRn-2 (n >= 3) 这里 a,b,u,v都是实数,称Rn 为广义Fibonacci数列。 现在让你计算广义Fibonacci数列的...原创 2018-03-16 11:30:39 · 271 阅读 · 1 评论 -
HDU 1568 Fibonacci (取对数)
FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5887 Accepted Submission(s): 2793Problem Description 2007年到来了。经过2006年一年的修炼,数学...原创 2018-03-17 15:38:26 · 168 阅读 · 0 评论 -
HDU 1588 Gauss Fibonacci(分块矩阵优化)
Gauss FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3663 Accepted Submission(s): 1580Problem Description Without expecting,...原创 2018-03-18 18:37:52 · 207 阅读 · 0 评论 -
HDU 3306 Another kind of Fibonacci(矩阵快速幂)
Another kind of FibonacciTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2962 Accepted Submission(s): 1184Problem Description As we al...原创 2018-03-18 19:39:51 · 275 阅读 · 0 评论 -
HDU 6304 Chiaki Sequence Revisited(找规律+二分)
Chiaki Sequence RevisitedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2004 Accepted Submission(s): 560Problem Description Chiaki is...原创 2018-07-25 19:34:16 · 327 阅读 · 0 评论 -
斐波那契数列的前N项和
我们知道斐波那契数列为 ⎧⎩⎨⎪⎪F1=1F2=1Fn=Fn−1+Fn−2n>2{F1=1F2=1Fn=Fn−1+Fn−2n>2\left\{\begin{matrix}F_1=1\\ F_2=1\\ F_n=F_{n-1}+F_{n-2} &&n>2\end{matrix}\right. 那么如何求解他的前N项和呢 我们可以通过他的通项入手,斐波那契数列的通项为 Fn...原创 2018-09-03 14:58:45 · 29640 阅读 · 1 评论 -
2019牛客暑期多校训练营(第九场)A.The power of Fibonacci(Fibonomial coefficients+常系数线性递推)
题意{f0=0f1=1fn=fn−1+fn−2,n≥2\left\{\begin{matrix}f_0=0\\ f_1=1\\ f_n=f_{n-1}+f_{n-2},n\geq 2\end{matrix}\right.⎩⎨⎧f0=0f1=1fn=fn−1+fn−2,n≥2给你nnn和mmm求∑i=0nfim %1000000000\sum_{i=0}^{n}...原创 2019-08-18 13:43:17 · 410 阅读 · 0 评论