一开始以为和斐波那契差不多,很简单的就能构造出矩阵。。。结过是乘法,硬是构造不出来。
可以由F[0] = a,F[1] = b,F[n] = F[n-1] * F[n-2] ( n > 1 ) 推出
fn = a^fib(n-1)*b^fib(n)%mod
可知这个指数是相当大的,所以需要用费马小定理或是欧拉定理降幂。
a ^ n = a ^ (n % euler ( M ) )*( mod M )
代码:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
ll n, a, b;
struct node
{
ll s[2][2];
node() {}
node(int a, int b, int c, int d)
{
s[0][0] = a;
s[0][1] = b;
s[1][0] = c;
s[1][1] = d;
}
};
node mul(node a, node b)
{
node t;
memset(t.s, 0, sizeof(t.s));
for(int i = 0; i < 2; i++)
for(int j = 0; j < 2; j++)
for(int k = 0; k < 2; k++)
t.s[i][j] = (t.s[i][j]+(a.s[i][k]*b.s[k][j])%(mod-1))%(mod-1);
return t;
}
ll mt_pow(node p, ll k)
{
node q = node(1, 0, 0, 1);
while(k)
{
if(k&1) q = mul(q, p);
p = mul(p, p);
k /= 2;
}
return (q.s[0][0]%(mod-1));
}
ll _pow(ll p, ll k)
{
p %= mod;
ll ans = 1;
while(k)
{
if(k&1) ans = ans*p%mod;
p = p*p%mod;
k /= 2;
}
return ans;
}
int main(void)
{
while(cin >> a >> b >> n)
{
if(n == 0) printf("%lld\n", a);
else if(n == 1) printf("%lld\n", b);
else if(n == 2) printf("%lld\n", a*b%mod);
else
{
node base = node(1, 1, 1, 0);
ll p1 = mt_pow(base, n-2);
ll p2 = mt_pow(base, n-1);
printf("%lld\n", _pow(a, p1)*_pow(b, p2)%mod);
}
}
return 0;
}
M斐波那契数列
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2953 Accepted Submission(s): 898
Problem Description
M斐波那契数列F[n]是一种整数数列,它的定义如下:
F[0] = a
F[1] = b
F[n] = F[n-1] * F[n-2] ( n > 1 )
现在给出a, b, n,你能求出F[n]的值吗?
F[0] = a
F[1] = b
F[n] = F[n-1] * F[n-2] ( n > 1 )
现在给出a, b, n,你能求出F[n]的值吗?
Input
输入包含多组测试数据;
每组数据占一行,包含3个整数a, b, n( 0 <= a, b, n <= 10^9 )
每组数据占一行,包含3个整数a, b, n( 0 <= a, b, n <= 10^9 )
Output
对每组测试数据请输出一个整数F[n],由于F[n]可能很大,你只需输出F[n]对1000000007取模后的值即可,每组数据输出一行。
Sample Input
0 1 0 6 10 2
Sample Output
0 60
Source
Recommend
liuyiding