HDU-1757-A Simple Math Problem

Lele now is thinking about a simple function f(x).
  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 .
Now, I will give a0 ~ a9 and two positive integers k and m ,and could you help Lele to caculate f(k)%m.
Input
  The problem contains mutiple test cases.Please process to the end of file.
In each case, there will be two lines.
In the first line , there are two positive integers k and m. ( k<2*10^9 , m < 10^5 )
In the second line , there are ten integers represent a0 ~ a9.
Output
  For each case, output f(k) % m in one line.
Sample Input
10 9999
1 1 1 1 1 1 1 1 1 1
20 500
1 0 1 0 1 0 1 0 1 0
Sample Output
45
104

解释：
首先 f(x) = a0 * f(x-1) + a1 * f(x-2) + a2 * f(x-3) + …… + a9 * f(x-10),所以矩阵数组的宽度和长度应为10；
输入a₀–a₉:
输入在矩阵的第一行，作为F₉

for(int i=0;i<10;i++)
            scanf("%lld",&a.nmb[0][i]);

初始化：

for(int i=1;i<10;i++)
            a.nmb[i][i-1] = 1;

#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
const int maxn = 100;
typedef long long ll;
using namespace std;
ll k,m;
struct In{
    ll nmb[maxn][maxn];
};
In _mul(In x,In y){
    In ans;
    memset(ans.nmb,0,sizeof(ans.nmb));
    for(int i=0;i<10;i++){
        for(int j=0;j<10;j++){
            for(int k=0;k<10;k++){
                ans.nmb[i][j] = (ans.nmb[i][j]+x.nmb[i][k]*y.nmb[k][j]%m)%m;
            }
        }
    }
    return ans;
}
In _pow(In x,int p){
    In ans;
    for(int i=0;i<10;i++){
        for(int j=0;j<10;j++){
            if(i==j) ans.nmb[i][j] = 1;
            else ans.nmb[i][j] = 0;
        }
    }
    while(p){
        if(p&1) ans = _mul(ans,x);
        p >>= 1;
        x = _mul(x,x);
    }
    return ans;
}
int main(void)
{
    while(~scanf("%lld%lld",&k,&m)){
        In a,ans;
        memset(a.nmb,0,sizeof(a.nmb));
        for(int i=0;i<10;i++)
            scanf("%lld",&a.nmb[0][i]);
        for(int i=1;i<10;i++)
            a.nmb[i][i-1] = 1;
        if(m<10)   printf("%lld\n",m%k);
        else{
            ans = _pow(a,k-9);
            ll mm=0;
            for(int i=0;i<10;i++)
                mm = (mm+ans.nmb[0][i]*(9-i)%m)%m;
            printf("%lld\n",mm);
        }
    }
    return 0;
}