经过几次比较,目前总结封装矩阵的模板
加上优化,用这个代码可以0MS过杭电上的一道题(以后可能还有更快的)
typedef long long ll;
const int MAXN = 10;
long long mod;
struct Matrix{
long long mat[MAXN][MAXN];
void Zero(){
memset(mat, 0, sizeof(mat));
}
void Unit(){
memset(mat, 0, sizeof(mat));
for (int i = 0; i < MAXN; i++)
mat[i][i] = 1;
}
void output(){
for (int i = 0; i < MAXN; i++){
for (int j = 0; j < MAXN; j++){
printf("%d ", mat[i][j]);
}
printf("\n");
}
}
};
Matrix operator*(Matrix &a, Matrix &b){
Matrix tmp;
tmp.Zero();///初始化
for (int k = 0; k < MAXN; k++){
for (int i = 0; i < MAXN; i++){
if (!a.mat[i][k])
continue;
for (int j = 0; j < MAXN; j++){
tmp.mat[i][j] += a.mat[i][k] * b.mat[k][j] % mod;
if ( tmp.mat[i][j] >= mod)
tmp.mat[i][j] -= mod;
}
}
}
return tmp;
}
Matrix operator ^(Matrix a, int k){
Matrix tmp;///单位矩阵
tmp.Unit();
if(k<=1)
return a;
for (; k; k >>= 1){
if (k & 1)
tmp = tmp * a;
a = a * a;
}
return tmp;
}
传送门:http://acm.split.hdu.edu.cn/showproblem.php?pid=4990
代码:(0MS)
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include