矩阵快速幂 HDU1575

点击打开链接

//#include <bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf  0x7fffffff
#define linf 0x7fffffffffffffff
#define fill(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define sc(n) scanf("%s",&n)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define pff(x) printf("%lf\n",x)
#define N 200005
#define M 4000009
#define mod 9973
#define pi acos(-1)
//cout.setf(ios::fixed);
//freopen("out.txt","w",stdout);
using namespace std;
typedef long long ll;
typedef double db;
inline int scan(int &n)
{
    int res=0,ch,flag=0;
    if((ch=getchar())=='-')flag=1;
    else if(ch>='0' && ch<='9')res=ch-'0';
    while((ch=getchar())>='0'&&ch<='9')res=res*10+ch-'0';
    n= flag ? -res : res;
}
int n;
struct node
{
    int m[15][15];
};
node mult(node a,node b)
{
    node c;
    fup(i,1,n)
    fup(j,1,n)
    c.m[i][j]=0;
    fup(i,1,n)
    fup(j,1,n)
    fup(k,1,n)
    c.m[i][j]=(c.m[i][j]+a.m[i][k]*b.m[k][j])%mod;
    return c;
}
node quick(node a,int b)
{
    node ans;
    fup(i,1,n)
    fup(j,1,n)
    if(i==j) ans.m[i][j]=1;
    else ans.m[i][j]=0;
    while(b)
    {
        if(b&1) ans=mult(a,ans);
        a=mult(a,a);
        b/=2;
    }
    return ans;
}
int main()
{
    int t;
    sd(t);
    while(t--)
    {
        node a;
        int k,ans=0;
        sdd(n,k);
        fup(i,1,n)
        fup(j,1,n)
        sd(a.m[i][j]);
        node b=quick(a,k);
        fup(i,1,n)
        ans=(ans+b.m[i][i])%mod;
        pf(ans);
    }
    return 0;
}