矩阵快速幂
文章平均质量分 67
elbadaernu
这个作者很懒,什么都没留下…
展开
-
hdu6185 Covering (递推+矩阵快速幂)
Problem Description Bob’s school has a big playground, boys and girls always play games here after school.To protect boys and girls from getting hurt when playing happily on the playground, rich boy B原创 2017-09-03 21:51:31 · 3170 阅读 · 5 评论 -
Number Sequence HDU - 1005 (矩阵快速幂)
Problem Description 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).Input The input co原创 2017-09-08 21:11:20 · 487 阅读 · 0 评论 -
Algebraic Problem LightOJ - 1070 (递推+矩阵快速幂)
Given the value of a+b and ab you will have to find the value of a^n+b^n. a and b not necessarily have to be real numbers.Input Input starts with an integer T (≤ 10000), denoting the number of test ca原创 2017-09-08 22:37:01 · 241 阅读 · 0 评论 -
hdu6198 number number number(找规律+矩阵快速幂)
Problem DescriptionWe define a sequence F:⋅ F0=0,F1=1; ⋅ Fn=Fn−1+Fn−2 (n≥2).Give you an integer k, if a positive number n can be expressed by n=Fa1+Fa2+…+Fak where 0≤a1≤a2≤⋯≤ak, this positive number原创 2017-09-10 22:40:12 · 807 阅读 · 0 评论 -
Summing up Powers LightOJ - 1132 (推导+二项式定理+矩阵快速幂)
Given N and K, you have to find(1^K + 2^K + 3^K + … + N^K) % 2^32Input Input starts with an integer T (≤ 200), denoting the number of test cases.Each case contains two integers N (1 ≤ N ≤ 10^15) and K原创 2017-09-11 22:10:34 · 381 阅读 · 0 评论 -
Guessing the Dice Roll HDU - 5955 (矩阵快速幂+推导)
Farmer John likes to play mathematics games with his N cows. Recently, they are attracted by recursive sequences. In each turn, the cows would stand in a line, while John writes two positive numbers a原创 2017-10-26 21:10:09 · 606 阅读 · 1 评论