题意:
给定n,要求计算:
⌊
(
2
+
3
)
2
n
⌋
%
1024
\lfloor(\sqrt{2}+\sqrt{3})^{2n}\rfloor \%1024
⌊(2+3)2n⌋%1024
数据范围:n<=1e9
解法:
⌊ ( 2 + 3 ) 2 n ⌋ % 1024 \lfloor(\sqrt{2}+\sqrt{3})^{2n}\rfloor \%1024 ⌊(2+3)2n⌋%1024
= ⌊ ( 5 + 2 6 ) n ⌋ % 1024 \lfloor(5+2\sqrt{6})^n\rfloor \%1024 ⌊(5+26)n⌋%1024
最后一定是 x n + y n 6 x_{n}+y_{n}\sqrt{6} xn+yn6的形式
x n + y n 6 = ( x n − 1 + y n − 1 6 ) ∗ ( 5 + 2 6 ) x_{n}+y_{n}\sqrt{6}=(x_{n-1}+y_{n-1}\sqrt{6})*(5+2\sqrt{6}) xn+yn6=(xn−1+yn−16)∗(5+26)
= 5 x n − 1 + 5 6 y n − 1 + 2 6 x n − 1 + 12 y n − 1 5x_{n-1}+5\sqrt{6}y_{n-1}+2\sqrt{6}x_{n-1}+12y_{n-1} 5xn−1+56yn−1+26xn−1+12yn−1
= ( 5 x n − 1 + 12 y n − 1 ) + ( 2 x n − 1 + 5 y n − 1 ) 6 (5x_{n-1}+12y_{n-1})+(2x_{n-1}+5y_{n-1})\sqrt{6} (5xn−1+12yn−1)+(2xn−1+5yn−1)6
x n = 5 x n − 1 + 12 y n − 1 x_{n}=5x_{n-1}+12y_{n-1} xn=5xn−1+12yn−1
y n = 2 x n − 1 + 5 y n − 1 y_{n}=2x_{n-1}+5y_{n-1} yn=2xn−1+5yn−1
那么可以构造出矩阵:
(
5
−
2
6
)
n
=
x
n
−
y
n
6
=
0.10102
1
n
<
1
(5-2\sqrt{6})^n=x_{n}-y_{n}\sqrt{6}=0.101021^n<1
(5−26)n=xn−yn6=0.101021n<1
x n + y n 6 = x n + y n 6 + ( x n − y n 6 ) − ( x n − y n 6 ) = 2 x n − 0.10102 1 n x_{n}+y_{n}\sqrt{6}=x_{n}+y_{n}\sqrt{6}+(x_{n}-y_{n}\sqrt{6})-(x_{n}-y_{n}\sqrt{6})=2x_{n}-0.101021^n xn+yn6=xn+yn6+(xn−yn6)−(xn−yn6)=2xn−0.101021n
后面一项虽然小,但是下取整之后会使得 2 x n 2x_{n} 2xn减1,因此答案为 2 x n − 1 2x_{n}-1 2xn−1
code:
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxm=3e5+10;
const int mod=1024;
struct Node{
int a[2][2];
Node operator*(const Node& b)const{
Node ans={
0,0,
0,0,
};
for(int k=0;k<2;k++){
for(int i=0;i<2;i++){
for(int j=0;j<2;j++){
ans.a[i][j]+=a[i][k]*b.a[k][j]%mod;
ans.a[i][j]%=mod;
}
}
}
return ans;
}
};
Node ppow(Node a,int b){
Node ans={
1,0,
0,1,
};
while(b){
if(b&1)ans=ans*a;
a=a*a;
b>>=1;
}
return ans;
}
signed main(){
int T;cin>>T;
while(T--){
int n;cin>>n;
Node base={
5,2,
12,5,
};
Node temp=ppow(base,n-1);
int ans=(5*temp.a[0][0]+2*temp.a[1][0])%mod;
cout<<(2*ans-1+mod)%mod<<endl;
}
return 0;
}