编号：时间：2021年x月x日书山有路勤为径，学海无涯苦作舟页码：第PAGE33页共NUMPAGES33页第PAGE\*MERGEFORMAT33页共NUMPAGES\*MERGEFORMAT33页代码仓库目录：01.【数学方法】矩阵快速幂02.【数学方法】高斯消元（naïve版）03.【数学方法】高斯消元（mid版）04.【字符串啊】Manacher算法（回文串）05.【字符串啊】KMP（字符串匹配）06.【数据结构】线段树（ZKW单点修改）07.【数据结构】线段树（RMQ）08.【数据结构】线段树（区间加+赋值）09.【数据结构】Splay树（未完全测试）////！！！！10.【数据结构】AVL树（平衡树）11.【图论图论】最小生成树（prim）12.【图论图论】次小生成树13.【图论图论】最大流（Dinic）14.【图论图论】LCA+最大生成树（truck）15.【动态规划】背包01，多重，完全矩阵模板#include<cstdio>#include<cstring>#include<iostream>usingnamespacestd;typedeflonglongll;constintP=9973;constintN=13;lln,m;structmatrix{lla[N][N];introw,col;matrix():row(N),col(N){memset(a,0,sizeof(a));}//？？？matrix(intx,inty):row(x),col(y){memset(a,0,sizeof(a));}ll*operator[](intx){returna[x];}matrixoperator*(matrixx){matrixtmp;for(inti=0;i<=n+1;i++)for(intj=0;j<=n+1;j++){tmp[i][j]=0;for(intk=0;k<=n+1;k++)tmp[i][j]=(tmp[i][j]+a[i][k]*x[k][j])%P;}returntmp;}voidoperator*=(matrixx){*this=*this*x;}matrixoperator^(llx){matrixret;for(inti=0;i<=n+1;i++)ret[i][i]=1;matrixtmp=*this;for(;x;x>>=1,tmp*=tmp){if(x&1)ret*=tmp;}returnret;}voidprint(){for(inti=0;i<=n+1;i++){for(intj=0;j<=n+1;j++)printf("%d",a[i][j]);puts("");}}};高斯消元，判断有无解的#include<cstdio>#include<cmath>#include<cstring>#include<iostream>#include<vector>usingnamespacestd;typedeflonglongLL;constdoubleEPS=1e-6;constintN=55;structmatrix{inta[N][N];introw,col;matrix():row(N),col(N){memset(a,0,sizeof(a));}matrix(intx,inty):row(x),col(y){memset(a,0,sizeof(a));}int*operator[](intx){returna[x];}voidprint(){for(inti=0;i<row;i++){for(intj=0;j<col;j++)printf("%d",a[i][j]);puts("");}puts("");}};intGauss(matrixa,intm,intn){intx_cnt=0;intcol,k;//col为列号,k为行号for(k=0,col=0;k<m&&col<n;++k,++col){intr=k;//r为第col列的一个1for(inti=k;i<m;++i)if(a[i][col])r=i;if(!a[r][col]){k--;continue;}if(r!=k)for(inti=col;i<=n;++i)swap(a[r][i],a[k][i]);for(inti=k+1;i<m;++i)if(a[i][col])//消元for(intj=col;j<=n;++j)a[i