HDU 1757

题意：给你n,m,a0……a9；

If x < 10 f(x) = x.
If x >= 10 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10);
And ai(0<=i<=9) can only be 0 or 1 .

求f(n)%m;

#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<string>
//#include<map>
#include<cmath>
#include<iostream>
#include <queue>
#include <stack>
#include<algorithm>
#include<set>
using namespace std;
#define INF 1e8
#define inf -0x3f3f3f3f
#define eps 1e-8
#define LL long long
#define maxn 10
#define mol 10007
struct mat
{
    __int64 a[10][10];
};
mat unit;
int mod;
mat multi(mat a,mat b) 
{
    mat c;
    for(int i=0;i<10;i++)
        for(int j=0;j<10;j++) 
        {
            c.a[i][j] = 0;
            for(int k=0;k<10;k++) 
            {
                c.a[i][j] += a.a[i][k]*b.a[k][j];
            }
            c.a[i][j] %= mod;
        }
        return c;
}

mat quick(mat a,int k) 
{
    mat c,p,ans = unit;
    p = a;
    while(k) 
    {
        if(k&1)
        {
            ans = multi(ans,p);
            k--;
        }
        else 
        {
            k >>= 1;
            p = multi(p,p);
        }
    }
    return ans;
}

void cll() {
    for(int i=0;i<10;i++)
        for(int j=0;j<10;j++) 
            unit.a[i][j] = (i == j ? 1 : 0);
}

int main() 
{
     int k,m;
     int a[11];
     while(~scanf("%d%d",&k,&mod))
     {
         for(int i=1;i<=10;i++)
             scanf("%d",&a[i]);
         if(k<10)
         {
              printf("%d\n",k%mod);
              continue;
         }
         mat c,p,tt,cnt;
         cll();
         memset(c.a,0,sizeof(c.a));
         memset(p.a,0,sizeof(p.a));
         for(int i=0;i<10;i++) c.a[9][i]=a[10-i]; 
         c.a[0][1] = c.a[1][2] =c.a[2][3] = c.a[3][4] =c.a[4][5] =c.a[5][6]=c.a[6][7] =
             c.a[7][8] = c.a[8][9] =1;
         tt=quick(c,k-9);
         for(int i=0;i<10;i++)
             p.a[i][0]=i;
         cnt=multi(tt,p);
         printf("%d\n",cnt.a[9][0]%mod);
     }
    return 0;
}