Luogu-3390 (矩阵快速幂模板)

题目链接 https://www.luogu.org/problemnew/show/P3390

#include <cstdio>
#define Ha 1000000007
typedef long long ll;
ll n,k;
struct matrix{
    ll a[105][105];
    void init(){
        for (ll i=1; i<=n; i++) a[i][i]=1;
    }
    void pri(){
        for (ll i=1; i<=n; i++,puts(""))
            for (ll j=1; j<=n; j++)
                printf("%lld ",a[i][j]);
    }
} A,B;

matrix mul(matrix x,matrix y){
    matrix ret={0};
    for (ll i=1; i<=n; i++)
        for (ll j=1; j<=n; j++)
            for (ll k=1; k<=n; k++)
                ret.a[i][j]=(ret.a[i][j]+x.a[i][k]*y.a[k][j])%Ha;
    return ret;
}

matrix ksm(matrix x,ll y){
    matrix ret={0};
    ret.init();
    for (; y; y>>=1,x=mul(x,x))
        if (y&1) ret=mul(ret,x);
    return ret;
}

int main(){
    //freopen("1.txt","r",stdin);
    //freopen("2.txt","w",stdout);
    scanf("%lld%lld",&n,&k);
    for (ll i=1; i<=n; i++)
        for (ll j=1; j<=n; j++)
            scanf("%lld",&A.a[i][j]);
    B=ksm(A,k);
    B.pri();
}

相关题目 http://blog.csdn.net/jackypigpig/article/details/78363631