uva10870 Recurrences

Consider recurrent functions of the following form: f ( n ) = a 1 f (
n

矩阵快速幂。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define LL long long
int n,m,d;
struct mat
{
    int a[20][20];
    mat operator * (const mat & rhs) const
    {
        mat ret;
        for (int i=1;i<=d;i++)
          for (int j=1;j<=d;j++)
          {
            ret.a[i][j]=0;
            for (int k=1;k<=d;k++)
              ret.a[i][j]=(ret.a[i][j]+(LL)a[i][k]*rhs.a[k][j])%m;
          }
        return ret;
    }
}base,a;
int main()
{
    int i,p,x;
    while (scanf("%d%d%d",&d,&n,&m)&&d)
    {
        memset(a.a,0,sizeof(a.a));
        memset(base.a,0,sizeof(base.a));
        for (i=1;i<=d;i++)
          scanf("%d",&x),base.a[d-i+1][d]=x%m;
        for (i=1;i<=d;i++)
          scanf("%d",&x),a.a[1][i]=x%m;
        for (i=1;i<d;i++)
          base.a[i+1][i]=1;
        p=n-d;
        while (p)
        {
            if (p&1) a=a*base;
            base=base*base;
            p>>=1;
        }
        printf("%d\n",a.a[1][d]);
    }
}