hdu 5015 233 Matrix

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5015

很明显矩阵快速幂，由于题目给定n<=10,因此我们可以固定行，从而可以用列推出列，有第一行0，233，2333，...和a i,j = a i-1,j +a i,j-1可得 第一行是10 0 ......1 第二行是10 1 0 ......1，倒二行是10 1 1 .....1 最后一行是0 0 0 ...1。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;

typedef long long ll;
const int mod = 10000007;
int n, q;
ll c[15];

struct matrix{
    ll m[15][15];
}a;

matrix mul(matrix a, matrix b)
{
    matrix c;
    memset(c.m,0,sizeof(c.m));
    for(int i = 0; i <= n+1; i++)
        for(int j = 0; j <= n+1; j++)
            for(int k = 0; k <= n+1; k++)
                c.m[i][j]=(c.m[i][j]+a.m[i][k]*b.m[k][j]) % mod;
    return c;
}

void pow_k(int b)
{
    matrix ans;
    memset(ans.m, 0, sizeof(ans.m));
    for(int i = 0; i <= n+1; i++)
        ans.m[i][i] = 1;
    while(b > 0)
    {
        if(b & 1)
            ans = mul(ans, a);
        a = mul(a,a);
        b >>= 1;
    }
    ll s = 0;
    for(int i = 0; i <= n+1; i++)
        s = (s+(ans.m[n][i]*c[i])%mod)%mod;
    printf("%lld\n", s);
}

int main()
{
    while(cin >> n >> q)
    {
        c[0] = 23;
        c[n+1] = 3;
        for(int i = 1; i <= n; i++)
            cin >> c[i];
        memset(a.m, 0, sizeof(a.m));
        for(int i = 0; i <= n; i++)
        {
            a.m[i][0] = 10;
            a.m[i][n+1] = 1;
        }
        a.m[n+1][n+1] = 1;
        for(int i = 1; i < n+1; i++)
            for(int j = 1; j <= i; j++)
                a.m[i][j] = 1;
        pow_k(q);    
    }
    return 0;
}