hdu6172 Array Challenge（BM+常系数齐次线性递推）

传送门
思路：大胆猜想其有常系数线性递推式，然后$BM$算法加上多项式取模就可以
水过去。
$BM$出来发现最短线性递推式只有两项真是妙极了
$BM$算法讲解
常系数齐次线性递推讲解

代码：

#include<bits/stdc++.h>
#define ri register int
using namespace std;
const int mod=1e9+7;
typedef long long ll;
typedef vector<int> poly;
inline int add(int a,int b){return (a+=b)<mod?a:a-mod;}
inline int dec(int a,int b){return (a-=b)<0?a+mod:a;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline void Add(int&a,int b){(a+=b)<mod?a:a-=mod;}
inline void Dec(int&a,int b){(a-=b)<0?a+=mod:a;}
inline void Mul(int&a,int b){a=(ll)a*b%mod;}
inline int ksm(int a,int p){int ret=1;for(;p;p>>=1,Mul(a,a))if(p&1)Mul(ret,a);return ret;}
inline poly operator+(poly a,poly b){
	int n=a.size(),m=b.size();
	poly c(max(n,m));
	for(ri i=0;i<n;++i)Add(c[i],a[i]);
	for(ri i=0;i<m;++i)Add(c[i],b[i]);
	return c;
}
inline poly operator*(poly a,poly b){
	int n=a.size(),m=b.size();
	poly c(n+m-1);
	for(ri i=0;i<n;++i)for(ri j=0;j<m;++j)Add(c[i+j],mul(a[i],b[j]));
	return c;
}
inline poly operator%(poly a,poly b){
	int n=a.size()-1,m=b.size()-1;
	if(n<m)return a;
	for(ri t,i=n;i>=m;--i){
		t=a[i];
		for(ri j=i,k=m;~k;--j,--k)Dec(a[j],mul(b[k],t));
	}
	return a.resize(m),a;
}
const int N=15;
namespace Cayley_Hamilton{
	poly md,f,g;
	int k,a[N];
	inline void init(poly coe,int*A,int K){
		k=K;
		md.resize(k+1),md[k]=1;
		for(ri i=1;i<=k;++i)md[k-i]=coe[i]?mod-coe[i]:0;
		for(ri i=0;i<k;++i)a[i]=A[i+1];
	}
	inline int query(ll n){
		if(n<k)return a[n];
		f.resize(2),g.resize(1);
		f[1]=g[0]=1;
		for(;n;n>>=1,f=f*f%md)if(n&1)g=g*f%md;
		int ret=0;
		for(ri i=0;i<k;++i)Add(ret,mul(g[i],a[i]));
		return ret;		
	}
}
namespace Berlekamp_Massey{
	poly R[N];
	int cnt=0,a[N],det[N],fail[N];
	ll h[N],b[N];
	inline void update(int n){
		int t=a[n];
		for(ri i=1,up=R[cnt].size();i<up;++i)Dec(t,mul(a[n-i],R[cnt][i]));
		if(!t)return;
		det[fail[cnt]=n]=t;
		if(!cnt){R[++cnt].resize(n+1);return;}
		Mul(t,ksm(det[fail[cnt-1]],mod-2));
		R[cnt+1].resize(n-fail[cnt-1]),R[cnt+1].push_back(t);
		for(ri i=1,up=R[cnt-1].size();i<up;++i)R[cnt+1].push_back(mul(R[cnt-1][i],mod-t));
		R[cnt+1]=R[cnt+1]+R[cnt];
		++cnt;
	}
	inline void build(){
		h[0]=2,h[1]=3,h[2]=6;
		for(ri i=3;i<=12;++i)h[i]=h[i-1]*4+h[i-2]*17-h[i-3]*12-16;
		for(ri i=1;i<=11;++i)b[i]=h[i+1]*h[i]*3+h[i+1]*h[i-1]*9+h[i]*h[i]*9+h[i]*h[i-1]*27-h[i+1]*18-h[i]*126-h[i-1]*81+192;
		for(ri i=1;i<=9;++i){
			ll t=sqrt(b[i]+(1ll<<(i<<1)));
			a[i]=t%mod;
			update(i);
		}
		Cayley_Hamilton::init(R[cnt],a,R[cnt].size()-1);
	}
}
int main(){
	Berlekamp_Massey::build();
	int tt;
	ll n;
	scanf("%d",&tt);
	while(tt--)scanf("%lld",&n),cout<<Cayley_Hamilton::query(n-1)<<'\n';
	return 0;
}