fzu 1683 纪念SlingShot 矩阵

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define maxn 4
const int mod=2009;
int a[maxn][maxn]={
            {1,0,0,0},
            {1,3,1,0},
            {0,2,0,1},
            {0,7,0,0}
};
struct matrix{
    int f[maxn][maxn];
};
matrix mul(matrix a,matrix b)
{
    matrix c;
    memset(c.f,0,sizeof(c.f));
    int i,j,k;
    for(k=0;k<maxn;k++)
    {
        for(i=0;i<maxn;i++)
        {
            if(!a.f[i][k])continue;
            for(j=0;j<maxn;j++)
            {
                if(!b.f[k][j])continue;
                c.f[i][j]=(c.f[i][j]+a.f[i][k]*b.f[k][j])%mod;
            }
        }
    }
    return c;
}
matrix pow_mod(matrix a,int b)
{
    matrix s;
    int i,j;
    for(i=0;i<maxn;i++)
        for(j=0;j<maxn;j++)
        s.f[i][j]=(i==j?1:0);
    while(b)
    {
        if(b&1)
            s=mul(s,a);
        a=mul(a,a);
        b=b>>1;
    }
    return s;
}
int main()
{
    int T,tt=0;
    cin>>T;
    while(T--)
    {
        int n;
        cin>>n;
        cout<<"Case "<<++tt<<": ";
        if(n<2)
        {
            if(n==0)cout<<1<<endl;
            else if(n==1)cout<<4<<endl;
            continue;
        }
        matrix e;
        memcpy(e.f,a,sizeof(a));
        e=pow_mod(e,n-2);
        int ans;
        ans=(9*e.f[0][0]+28*e.f[1][0]+5*e.f[2][0]+3*e.f[3][0])%mod;
        cout<<ans<<endl;
    }
    return 0;
}
/*
    s[n]=f[n]+f[n-1]+...+f[1]+f[0];
    矩阵:
    |s[n-1] f[n] f[n-1] f[n-2]|*|1 0 0 0|=|s[n] f[n+1] f[n] f[n-1]|
                                |1 3 1 0|
                                |0 2 0 1|
                                |0 7 0 0|
*/