HDOJ4686(矩阵快速幂)

连接:https://cn.vjudge.net/contest/51124#problem/Cios 题意 7个数n,a,ax,ay,b,bx,by，a(i)  = a(i-1)+*ax+ay, b(i) = b(i-1) * bx+by,求a*b累加n次后mod1,000,000,007的数.spa 矩阵快速幂，5*5矩阵较难推出，看了别人题解很久才懂。.net #include <cstdi

>>阅读原文<<