HDU 1575(裸矩阵快速幂)

emmmmm..就是矩阵快速幂，直接附代码：

#include <cstdio>
using namespace std;
const int maxn = 100;
const int mod = 9973;
struct Matrix
{
    int m[maxn][maxn];
}ans,res;
int n;
Matrix mul(Matrix a,Matrix b)
{
    Matrix tmp;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            tmp.m[i][j] = 0;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            for(int k = 1; k <= n; k++)
                tmp.m[i][j] += ((a.m[i][k] % mod)*(b.m[k][j] % mod))%mod;
    return tmp;
}

void quickpow(int N)
{
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= n; j++)
            if(i == j)  ans.m[i][j] = 1;
            else ans.m[i][j] = 0;
    while(N)
    {
        if(N&1) ans = mul(ans,res);
        res = mul(res,res);
        N = N >>1;
    }
}

int main()
{
    int t,k,wu;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&k);
        wu = 0;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                scanf("%d",&res.m[i][j]);
        quickpow(k);
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                if(i == j)  wu += ans.m[i][j];
        printf("%d
",wu%mod);
    }
    return 0;
}