摘要:
矩阵M^k,求幂,如果k是偶数,M^k=M^(k/2)*M*(k/2)%mod; 如果k是奇数,M^k=M^(k/2)*M*(k/2)*M;采用二进制扫描#include#include#include#include#define N 11#define mod 9973using namespace std;struct Matrix{ int mat[N][N];};int n;Matrix Mat_Mul(Matrix M1,Matrix M2){ Matrix c; for(int i=0;i>=1; } return E;}int main(){ ... 阅读全文