hdu 1575 矩阵连乘2

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int mod=;
int n;
struct matrix
{
  int f[][];
};

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

     }
    return c;
}

matrix pow_mod(matrix a,int b)
{
    matrix s;
    int t;
    memset(s.f,,sizeof(s.f));
    for(int i=;i<n;i++)
    {
        s.f[i][i]=;
    }
    while(b)
    {

        t=b%;
        b/=;
        if(t!=)
            s=mul(s,a);
         a=mul(a,a);
    }
    return s;
}

int main()
{
    int t,k;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&k) ;
        matrix e;
       for(int i=;i<n;i++)
          for(int j=;j<n;j++)
          {
              scanf("%d",&e.f[i][j]);
          }

    e=pow_mod(e,k);
    int ans=;
    for(int i=;i<n;i++)
        ans=(ans+e.f[i][i])%mod;
    printf("%d\n",ans);
    }

    return ;
}