矩阵快速幂

#include<cstdio>
#include<cstring>
using namespace std;
int n,f;
struct Matrix{
    long long v[105][105];
}A,Ans;
Matrix operator *(Matrix A,Matrix B){
    Matrix C;
    memset(C.v,0,sizeof(C.v));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                C.v[i][j]+=(A.v[i][k]%1000000007)*(B.v[k][j]%1000000007);
                C.v[i][j]%=1000000007;
            }
        }
    }
    return C;
}
Matrix fastpower(Matrix A,long long n){
    Matrix Mid=A;
    while(n){
        if(n%2)
            Mid=A*Mid;
        A=A*A;
        n>>=1;
    }
    return Mid;
}
int main(){
    scanf("%d%d",&n,&f);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            scanf("%lld",&A.v[i][j]);
        }
    }
    Ans=fastpower(A,f-1);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            printf("%lld ",Ans.v[i][j]);
        }
        printf("
");
    }
    return 0;
}