思路:
用double来计算显然精度是不够的,先把2放进去就变成了(5+sqrt(6))^n。展开之后可以发现是an+bn*sqrt(6)的形式。同样的,我们有(5-sqrt(6))^n = an - bn*sqrt(6).
(5+sqrt(6))^n + (5-sqrt(6))^n = 2*an,
又因为0 < (5-sqrt(6))^n < 1,
所以(5+sqrt(6))^n 的整数部分就是2*an-1.
接下来就是怎么算an了,
我们令Fn = an + bn*sqrt(6)
Fn = (5+sqrt(6))*Fn-1
化简可得
Fn = (5*an-1 + 12*bn-1) + (2*an-1+5*bn-1)*sqrt(6)
这样就能构建一个矩阵
=
之后就可以通过矩阵快速幂求解了
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const int mod = 1024;
typedef vector<int>vec;
typedef vector<vec>mat;
mat mul(mat &A,mat &B)
{
mat C(A.size(),vec(B[0].size()));
for(int i = 0; i < A.size(); i++)
{
for(int k = 0; k < B.size(); k++)
{
for(int j = 0; j < B[0].size(); j++)
{
C[i][j] = (C[i][j] + A[i][k]*B[k][j])%mod;
}
}
}
return C;
}
mat pow(mat A,int n)
{
mat B(A.size(),vec(A.size()));
for(int i = 0; i < A.size(); i++)
B[i][i] = 1;
while(n)
{
if(n&1)
B = mul(B,A);
A = mul(A,A);
n >>= 1;
}
return B;
}
int n;
void solve()
{
mat A(2,vec(2));
A[0][0] = 5; A[0][1] = 12;
A[1][0] = 2; A[1][1] = 5;
A = pow(A,n-1);
int ans = ((A[0][0]*5+A[0][1]*2)*2-1)%mod;
printf("%d\n",ans);
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
cin >> n;
solve();
}
return 0;
}