UVA - 10870 Recurrences

题目链接

给定递推式，也给出系数数组和递推式前d项，直接套矩阵快速幂模板即可。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
ll N,mod;

struct matrix{
	ll x[20][20];
};

matrix multi(matrix a,matrix b){
	matrix tmp;
	memset(tmp.x,0,sizeof(tmp.x));
	for(int i=0;i<N;i++)
		for(int j=0;j<N;j++)
			for(int k=0;k<N;k++){
				tmp.x[i][j]=(tmp.x[i][j]+a.x[i][k]*b.x[k][j]%mod)%mod;
			}			
	return tmp;
}

matrix quick_multi(matrix a,int n){
	matrix tmp;
	for(int i=0;i<N;i++)
		for(int j=0;j<N;j++)
			tmp.x[i][j]=(i==j);
			
	while(n){
		if(n&1) tmp=multi(tmp,a);
		a=multi(a,a);
		n>>=1;
	}
	return tmp;
}

int main(){
	ll d,n,m;
	ll a[20],f[20];
	while(~scanf("%lld%lld%lld",&d,&n,&m)){
		if(!d&&!n&&!m) break;
		N=d,mod=m;
		for(int i=0;i<d;i++) scanf("%lld",&a[i]);
		for(int i=0;i<d;i++) scanf("%lld",&f[i]);
		matrix A;
		memset(A.x,0,sizeof(A.x));
		for(int i=0;i<d;i++){
			A.x[i][0]=a[i];
			A.x[i][i+1]=1;
		} 
		
		matrix ans;
		memset(ans.x,0,sizeof(ans.x));
		for(int i=0;i<d;i++) ans.x[0][i]=f[d-1-i];
		
		if(n==1){
			printf("%d\n",f[0]);
			continue;
		}
		A=quick_multi(A,n-d);
		ans=multi(ans,A);
		printf("%lld\n",ans.x[0][0]%mod);	
	}
	return 0;
}