Author 答案是a^f[n-2]*b^f[n-1] 求斐波那契数列的话矩阵快速幂 由于指数不能直接%mod 所以需要降幂 用到欧拉降幂公式 x^n %mod = x ^(n %phi(mod) +phi(mod))%mod 然后就OK了 #include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#define ll long long int
typedef struct Matrix
{
ll mat[2][2];
}matrix;
long long mod;
matrix A,B;
Matrix matrix_mul(matrix a,matrix b)
{
matrix c;
memset(c.mat,0,sizeof(c.mat));
int i,j,k;
for(int i=0;i<2;i++)
{
for(int j=0;j<2;j++)
{
for(int k=0;k<2;k++)
{
c.mat[i][j]+=a.mat[i][k]*b.mat[k][j];
c.mat[i][j]%=mod;
}
}
}
return c;
}
Matrix matrix_quick_power(matrix a,ll k)
{
matrix b;
memset(b.mat,0,sizeof(b.mat));
for(int i=0;i<2;i++)
b.mat[i][i]=1;
while(k)
{
if(k%2==1)
{
b=matrix_mul(a,b);
k-=1;
}
else
{
a=matrix_mul(a,a);
k/=2;
}
}
return b;
}
ll quickmi(ll a,ll b)
{
ll ans=1;
a%=mod;
while(b>0)
{
if(b%2==1)ans=(ans*a)%mod;
b/=2;
a=(a*a)%mod;
}
return ans;
}
int main()
{
ll a,b,n;
while(~scanf("%lld%lld%lld",&a,&b,&n))
{
mod=1e9+6;
A.mat[0][0]=0;A.mat[0][1]=1;
A.mat[1][0]=1;A.mat[1][1]=1;
if(n==0)
{
printf("%lld\n",a);
continue;
}
if(n==1)
{
printf("%lld\n",b);
continue;
}
B=matrix_quick_power(A,n-2);
A.mat[0][0]=1;A.mat[0][1]=1;
A.mat[1][0]=0;A.mat[1][1]=0;
A=matrix_mul(A,B);
mod++;
ll aa=quickmi(a,A.mat[0][0]+mod-1);
ll bb=quickmi(b,A.mat[0][1]+mod-1);
printf("%lld\n",aa*bb%mod);
}
}
|