【模板】矩阵快速幂

以洛谷P3390为例

#include<cstdio>
#include<cstring>
typedef long long ll;
ll n,k;
const ll mod=1e9+7;
struct Matrix{
    ll num[110][110];
};
Matrix Mul(Matrix mx,Matrix my)//矩阵乘法 
{
    Matrix ret;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        ret.num[i][j]=0;
    for(int i=1;i<=n;i