矩阵快速幂
文章平均质量分 70
h1021456873
这个作者很懒,什么都没留下…
展开
-
51nod 1126 求递推序列的第N项 (矩阵快速幂)
有一个序列是这样定义的:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.给出A,B和N,求f(n)的值。Input输入3个数:A,B,N。数字之间用空格分割。(-10000 Output输出f(n)的值。Input示例3 -1 5Output示例6原创 2015-10-28 17:11:08 · 923 阅读 · 0 评论 -
51nod 1242 斐波那契数列的第N项 (矩阵快速幂)
斐波那契数列的定义如下:F(0) = 0F(1) = 1F(n) = F(n - 1) + F(n - 2) (n >= 2)(1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, ...)给出n,求F(n),由于结果很大,输出F(n) % 1000000009的结果即可。Input原创 2015-10-28 17:08:22 · 509 阅读 · 0 评论 -
Codeforces 450B f【n】=f【n-1】-f【n-2】(矩阵快速幂,裸题)
Jzzhu has invented a kind of sequences, they meet the following property:You are given x and y, please calculate fn modulo1000000007 (109 + 7).InputThe first line contains two inte原创 2017-03-07 23:45:25 · 776 阅读 · 0 评论