#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
using namespace std;
#define LL long long
LL d,n,m,f[16];
struct matrix{
LL e[16][16];
}a,s;
matrix mul(matrix p,matrix q)//矩阵乘法
{
LL i,j,k;
matrix c;
for(i=1;i<=d;i++)
{
for(j=1;j<=d;j++)
{
c.e[i][j]=0;
for(k=1;k<=d;k++)
c.e[i][j]=(c.e[i][j]+p.e[i][k]*q.e[k][j])%m;
}
}
return c;
}
void matrix_pow(LL b)//矩阵快速幂
{
while(b)
{
if(b&1)
s=mul(s,a);
a=mul(a,a);
b=b>>1;
}
}
int main()
{
while(cin>>d>>n>>m)
{
if(n==0&&m==0&&d==0)
break;
LL i,j,k,ans;
memset(s.e,0,sizeof(s.e));
memset(a.e,0,sizeof(a.e));
for(i=1;i<=d;i++)
cin>>a.e[1][i];
s.e[1][1]=1;
for(i=2;i<=d;i++)
{
s.e[i][i]=1;
a.e[i][i-1]=1;
}
for(i=d;i>=1;i--)
cin>>f[i];
if(n>d)
{
matrix_pow(n-d);
ans=0;
for(i=1;i<=d;i++)
ans=(ans+f[i]*s.e[1][i])%m;
}
else
ans=f[d-n+1]%m;
cout<<ans<<endl;
}
return 0;
}
/*
f[n]=a1*f[n-1]+a2*f[n-2]+...+ad*f[n-d];
由于n太大,不能直接递推,需要用矩阵快速幂来解决,时间复杂度为O(d^3logn)
举例,d=5的矩阵关系式为:
|a1 a2 a3 a4 a5| | f[n] | | f[n+1] |
|1 | | f[n-1] | | f[n] |
| 1 | * | f[n-2] | = | f[n-1] | (空白处为0)
| 1 | | f[n-3] | | f[n-2] |
| 1 | | f[n-4] | | f[n-3] |
*/
UVA 10870 Recurrences 矩阵乘法
最新推荐文章于 2019-02-10 19:01:00 发布