有一个序列是这样定义的: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 <= A, B <= 10000, 1 <= N <= 10^9)
Output
输出f(n)的值。
Input示例
3 -1 5
Output示例
6
#include <iostream>
#include <algorithm>
#include <cmath>
#define MOD 7
#define N 2
using namespace std;
struct Matrix
{
long long v[N][N];
};
Matrix matrix_mul(Matrix A, Matrix B, long long m)
{
Matrix ans;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
ans.v[i][j] = 0;
for (int k = 0; k < N; k ++)
{
ans.v[i][j] += (A.v[i][k] * B.v[k][j]) % m;
}
ans.v[i][j] %= m;
}
}
return ans;
}
Matrix matrix_pow(Matrix C, long long n, long long m)
{
Matrix ans = {1, 0, 0, 1};
while (n)
{
if (n & 1)
ans = matrix_mul(ans, C, m);
C = matrix_mul(C, C, m);
n >>= 1;
}
return ans;
}
int main()
{
long long n;
int a,b;
cin>>a>>b>>n;
Matrix temp1 = {(a%MOD+MOD)%MOD, (b%MOD+MOD)%MOD, 1, 0}, temp2 = {1, 0, 1, 0}; // temp2{f[2],0,f[1],0}!!!!!
if (n < 2)
{
cout << 1 << endl;
return 0;
}
Matrix res = matrix_pow(temp1, n - 2, MOD);
res = matrix_mul(res, temp2, MOD);
cout << res.v[0][0] << endl;
return 0;
}
q神模板:
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
const int mod=7;
struct Matrix
{
int a[2][2];
Matrix()
{
for(int i=0;i<2;i++)
{
for(int j=0;j<2;j++)
{
a[i][j]=0;
}
}
}
void Init()
{
for(int i=0;i<2;i++)
{
a[i][i]=1;
}
}
Matrix operator * (const Matrix &B) const
{
Matrix C;
for(int i=0;i<2;i++)
{
for(int k=0;k<2;k++)
{
for(int j=0;j<2;j++)
{
C.a[i][j]=(C.a[i][j]+a[i][k]*B.a[k][j])%mod;
}
}
}
return C;
}
};
Matrix fp(Matrix A,int k)
{
Matrix res;
res.Init();
while(k>0)
{
if(k&1)res=res*A;
A=A*A;
k>>=1;
}
return res;
}
int main()
{
int a,b,n;
scanf("%d%d%d",&a,&b,&n);
Matrix A;
A.a[0][0]=(a%mod+mod)%mod;
A.a[0][1]=(b%mod+mod)%mod;
A.a[1][0]=1;
A=fp(A,n-2);
printf("%d\n",(A.a[0][0]+A.a[0][1])%mod);
return 0;
}