矩阵快速幂
阿龙的圈子
仰望星空 脚踏实地
向前走 永不停
展开
-
矩阵快速幂 poj 3070
#include #include using namespace std; const int MOD = 10000; struct Matrix { int m[2][2]; }; Matrix Mul(Matrix a, Matrix b) { Matrix tmp; for(int i=0; i<2; i++) for(int j=0;原创 2015-05-02 11:43:17 · 568 阅读 · 0 评论 -
多校 hdu
欢迎参加——每周六晚的BestCoder(有米!) The Goddess Of The Moon Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 746 Accepted Submission(s): 3原创 2015-07-30 10:10:28 · 683 阅读 · 0 评论 -
poj 3233 矩阵快速幂
Matrix Power Series Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 17981 Accepted: 7608 Description Given a n × n matrix A and a positive integer k, fi原创 2015-08-20 20:47:09 · 528 阅读 · 0 评论