DP+矩阵连乘

//这道题蛮好的。

http://www.acmerblog.com/hdu-3658-how-many-words-6619.html

#include <iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define ll __int64
const int mod=1000000007;
struct matrix
{
    ll f[52][52];
};
matrix mul(matrix a,matrix b)
{
    int i,j,k;
    matrix c;
    memset(c.f,0,sizeof(c.f));
    for(i=0;i<52;i++)
    {
        for(j=0;j<52;j++)
        {
            for(k=0;k<52;k++)
            {
                c.f[i][j]+=a.f[i][k]*b.f[k][j]%mod;
            }
            c.f[i][j]%=mod;
        }
    }
    return c;
}

matrix pow_mod(matrix a,int b)
{
    matrix s;
    int i,j;
    memset(s.f,0,sizeof(s.f));
    for(i=0;i<52;i++)
        s.f[i][i]=1;
    while(b)
    {
        if(b&1)//对于这个地方还是不懂
            s=mul(s,a);
        a=mul(a,a);
        b=b>>1;
    }
    return s;
}
int main()
{
    int casenum;
    scanf("%d",&casenum);
    while(casenum--)
    {
        int i,a[100],j;
        int n;
        scanf("%d",&n);
        for(i=0;i<26;i++)
        {
            a[i]=i;
            a[i+26]=32+i;
        }
        matrix d,g;
        memset(d.f,0,sizeof(d.f));
        memset(g.f,0,sizeof(g.f));
        for(j=0;j<52;j++)
        {
            for(i=0;i<52;i++)
            {
                if(abs(a[j]-a[i])<32)
                    d.f[i][j]=1;
                if(abs(a[j]-a[i])<=32)
                    g.f[i][j]=1;
            }
        }
        ll ans=0;
        d=pow_mod(d,n-1);
        g=pow_mod(g,n-1);
        for(i=0;i<52;i++)
        {
            for(j=0;j<52;j++)
            {
                ans+=g.f[i][j]-d.f[i][j];
            }
        }
        printf("%I64d\n",(ans%mod+mod)%mod);
    }
    return 0;
}