矩阵快速幂
bfcx
这个作者很懒,什么都没留下…
展开
-
【HDU - 1005】Number Sequence (矩阵快速幂)
A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).InputThe input consists of mul...原创 2019-03-19 12:53:10 · 278 阅读 · 0 评论 -
【HDU - 5451】Best Solver(矩阵快速幂+广义斐波拉契)
The so-called best problem solver can easily solve this problem, with his/her childhood sweetheart.It is known thaty=(5+2√6)^(1+2^x).For a given integerx(0≤x<2^32) and a given prime numberM...原创 2019-07-06 21:18:40 · 231 阅读 · 0 评论