M斐波那契数列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 )
Output
对每组测试数据请输出一个整数F[n],由于F[n]可能很大,你只需输出F[n]对1000000007取模后的值即可,每组数据输出一行。
Sample Input
0 1 0
6 10 2
Sample Output
0
60
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#define mod 1000000007
typedef struct mat//定义一个矩阵的结构体
{
__int64 mar[2][2];
} mat;
mat res = //基本矩阵
{
0 , 1,
1 , 1
};
mat multi(mat a,mat b) //自定义的矩阵乘法,模拟
{
int i,j,k;
mat c;
c.mar[0][0] = 0;
c.mar[0][1] = 0;
c.mar[1][0] = 0;
c.mar[1][1] = 0;
for(i = 0; i < 2; i ++)
for(j = 0; j < 2; j ++)
{
for(k = 0; k < 2; k ++)
{
c.mar[i][j] = c.mar[i][j] + a.mar[i][k] * b.mar[k][j] % (mod - 1);
c.mar[i][j] = c.mar[i][j] % (mod - 1);
}
}
return c;
}
mat mat_mod(__int64 n)//对矩阵取快速幂,用自定义的矩阵乘法代替乘法
{
mat c;
if(n == 1)return res;
c = mat_mod(n / 2);
if(n % 2 == 1) return multi(multi(c,c),res);
return multi(c,c);
}
__int64 int_mod(__int64 a,__int64 fa)//快速幂
{
__int64 c;
if(fa == 1)return a;
c = int_mod(a,fa / 2);
if(fa % 2 == 1) return (c * c % mod) * (a % mod) % mod;
return c * c % mod;
}
int main()
{
__int64 a,b,n,c,fa,fb;
mat s;
while(scanf("%I64d %I64d %I64d",&a,&b,&n) != EOF)
{
if(n == 0){printf("%I64d\n",a);continue;}
if(n == 1){printf("%I64d\n",b);continue;}
if(a == 0 || b == 0)
{
printf("0\n");
continue;
}
s = mat_mod(n - 1);
fa = s.mar[1][0];
fb = s.mar[1][1];
c = int_mod(a,fa) * int_mod(b,fb) % mod;
printf("%I64d\n",c);
}
return 0;
}