![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
矩阵
henuzxy
已经成为刷题过千的男人,即将成为cf 1900分的男人。
展开
-
Poj 3070 矩阵快速幂(找规律法)
In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, 1, 1, 2, 3, 5, 8, 13, 21, 34, …An alternative fo原创 2017-07-04 14:48:05 · 432 阅读 · 0 评论 -
POJ 3233(矩阵快速幂的转化法)
传送门 Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.Input The input contains exactly one test case. The first line of input contains three positive integers n (原创 2017-08-28 11:23:36 · 222 阅读 · 0 评论