http://acm.hdu.edu.cn/showproblem.php?pid=2256
sol:
容易得到(int)(Xn+Yn*sqrt(6))%1024的式子,然而这个式子不够。
对其进行转化后能变成2xn-1(找规律选手)
下面是一份写的不错的题解
引用自http://blog.csdn.net/chenguolinblog/article/details/10212567
#include<cstdio>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<iostream>
using namespace std;
const int pyz=1024;
int n,m;
inline int read()
{
char c;
int res,flag=0;
while((c=getchar())>'9'||c<'0') if(c=='-')flag=1;
res=c-'0';
while((c=getchar())>='0'&&c<='9') res=(res<<3)+(res<<1)+c-'0';
return flag?-res:res;
}
const int N=3;
int tmp[N][N];
int a[N][N],b[N][N];
inline void simplex(int a[N][N],int b[N][N])
{
memset(tmp,0,sizeof(tmp));
for(int i=1;i<=2;++i)
for(int j=1;j<=2;++j)
for(int k=1;k<=2;++k)
tmp[i][j]=(tmp[i][j]+a[i][k]*b[k][j]%pyz)%pyz;
for(int i=1;i<=2;++i)
for(int j=1;j<=2;++j)
a[i][j]=tmp[i][j];
}
inline void ksm(int t)
{
while(t)
{
if(t&1) simplex(a,b);
simplex(b,b);
t>>=1;
}
}
inline void solve()
{
n=read();
memset(a,0,sizeof(a));
b[1][1]=5;
b[1][2]=2;
b[2][1]=12;
b[2][2]=5;
a[1][1]=5;
a[1][2]=2;
ksm(n-1);
printf("%d\n",(2*a[1][1]-1)%pyz);
}
int main()
{
// freopen("2256.in","r",stdin);
// freopen(".out","w",stdout);
int T=read();
while(T--) solve();
}