matrix multi(matrix a, matrix b)
{
matrix tmp;
for(int i = 0; i < 55; ++i) //55是base的范围
{
for(int j = 0; j < 55; ++j)
{
for(int k = 0; k < 55; ++k)
tmp.m[i][j] = (tmp.m[i][j] + a.m[i][k] * b.m[k][j]) % Mod;
}
}
return tmp;
}
matrix fast_mod(matrix base, int m,int n) // 求矩阵 base 的m次幂 n为base的范围
{
matrix ans;
for(int i = 1; i <= n; i++)
ans.m[1][i] = 1;
while(m)
{
if(m & 1) //实现 ans *= t; 其中要先把 ans赋值给 tmp,然后用 ans = tmp * t
ans = multi(ans, base);
base = multi(base, base);
m >>= 1;
}
return ans;
}
ans[1][n+1]即为答案