hdu 1575 Tr A 矩阵基础题

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL __int64
const int mod=9973;
int n;
struct matrix{
    int f[10][10];
};
matrix mul(matrix a,matrix b)
{
    int i,j,k;
    matrix c;
    memset(c.f,0,sizeof(c.f));
    for(k=0;k<n;k++)
    {
        for(i=0;i<n;i++)
        {
            if(!a.f[i][k])continue;
            for(j=0;j<n;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;
    memset(s.f,0,sizeof(s.f));
    for(int i=0;i<n;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 T;
    cin>>T;
    while(T--)
    {
        int i,j,k;
        matrix e;
        cin>>n>>k;
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                cin>>e.f[i][j];
        e=pow_mod(e,k);
        int ans=0;
        for(i=0;i<n;i++)
            ans=(ans+e.f[i][i])%mod;
        cout<<ans<<endl;
    }
    return 0;
}