P3390 【模板】矩阵快速幂

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<math.h>
#include<cstdio>
using namespace std;
#define LL  unsigned long long 
#define MOD 1000000007
LL n,k;
struct node{
    LL v[109][109];
}p,x,ans,b;
node ch(node x,node y)
{
    
    for(int i=1;i<=n;i++)
       for(int j=1;j<=n;j++)
    {    
        p.v[i][j]=0;
        for(int k=1;k<=n;k++)
         p.v[i][j]=(p.v[i][j]+1LL*x.v[i][k]*y.v[k][j] )%MOD;
    }    
    return p;
}
void fastlow( )
{
    while(k)
    {
        if(k%2)    ans=ch(ans,x);
        k/=2; x=ch(x,x);
    }
} 
int main()
{
    scanf("%lld%lld",&n,&k);
    for(int i=1;i<=n;i++)
    for(int j=1;j<=n;j++)
        scanf("%lld",&x.v[i][j]);
    ans=x;k--;
    fastlow();
    for(int i=1;i<=n;i++ ,cout<<endl)
    for(int j=1;j<=n;j++ )
    printf("%lld ",ans.v[i][j]);
    return 0;
}