一、矩阵乘法
1.002
struct Match{
long long m[Maxn][Maxn];
Match() {
memset(m, 0, sizeof(m));
}
void init() {
for (int i = 0;i < Maxn;i++)
m[i][i] = 11;
}
Match operator* (const Match& b)const {
Match res;
for (int i = 1;i <= n;i++)
for (int j = 1;j <= n;j++) {
long long& cur = res.m[i][j];
for (int k = 1;k <= n;k++)
cur = (cur + m[i][k] * b.m[k][j]) % MOD;
}
return res;
}
};
总结
提示:哪有什么总结,洗洗睡吧。