矩阵快速幂
兔蠢蠢
这个作者很懒,什么都没留下…
展开
-
hdu4565(矩阵快速幂)
So Easy!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4459 Accepted Submission(s): 1467Problem Description A sequence Sn i原创 2017-07-29 20:37:47 · 665 阅读 · 1 评论 -
2019牛客暑期多校训练营(第九场)A.The power of Fibonacci(循环节)
题意{f0=0f1=1fn=fn−1+fn−2,n≥2\left\{\begin{matrix}f_0=0\\ f_1=1\\ f_n=f_{n-1}+f_{n-2},n\geq 2\end{matrix}\right.⎩⎨⎧f0=0f1=1fn=fn−1+fn−2,n≥2给你nnn和mmm求∑i=0nfim %1000000000\sum_{i=0}^{n}...原创 2019-08-16 19:54:53 · 527 阅读 · 3 评论 -
HDU 6395 Sequence(分块矩阵快速幂)
SequenceTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 1585 Accepted Submission(s): 568Problem Description Let us define a sequence...原创 2018-08-14 20:12:06 · 269 阅读 · 0 评论 -
HDU 6198 number number number(二进制枚举子集打表找规律+矩阵快速幂)
number number number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 875 Accepted Submission(s): 533Problem Description We define a seq...原创 2018-06-05 19:59:45 · 224 阅读 · 0 评论 -
HDU 4291 A Short problem(找循环节+快速幂)
A Short problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2955 Accepted Submission(s): 1032Problem Description According to a r...原创 2018-05-05 20:31:15 · 189 阅读 · 0 评论 -
HDU 3306 Another kind of Fibonacci(矩阵快速幂)
Another kind of FibonacciTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2962 Accepted Submission(s): 1184Problem Description As we al...原创 2018-03-18 19:39:51 · 258 阅读 · 0 评论 -
HDU 1588 Gauss Fibonacci(分块矩阵优化)
Gauss FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3663 Accepted Submission(s): 1580Problem Description Without expecting,...原创 2018-03-18 18:37:52 · 189 阅读 · 0 评论 -
POJ 3744 Scout YYF I (概率dp快速幂优化)
Scout YYF I Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10125 Accepted: 2954 DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate...原创 2018-03-10 13:07:54 · 174 阅读 · 0 评论 -
HDU 4602 Partition (矩阵快速幂或求通项)
PartitionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3462 Accepted Submission(s): 1348Problem Description Define f(n) as the number of原创 2017-12-04 12:59:54 · 261 阅读 · 0 评论 -
51Nod 1341 混合序列(矩阵快速幂)
思路:把f(n)展开有 f(n)=a0bn+a1bn−1+a2bn−2+⋯+anb0f\left ( n \right )=a_{0}b_{n}+a_{1}b_{n-1}+a_{2}b_{n-2}+\cdots +a_{n}b_{0}再写出n-1f(n−1)=a0bn−1+a1bn−2+a2bn−3+⋯+an−1b0f\left ( n-1 \right )=a_{0}b_{n-1}+a_{1}b原创 2017-08-23 13:42:46 · 243 阅读 · 0 评论 -
HDU 6172 Array Challenge(靠猜)
Array ChallengeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 153428/153428 K (Java/Others) Total Submission(s): 237 Accepted Submission(s): 113Problem Description There’s an array that i原创 2017-08-25 15:57:53 · 404 阅读 · 0 评论 -
HDU 6050 Funny Function(矩阵快速幂或公式)
Funny FunctionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1352 Accepted Submission(s): 689Problem DescriptionFunction Fx,原创 2017-08-21 20:50:07 · 299 阅读 · 0 评论 -
2019牛客暑期多校训练营(第九场)A.The power of Fibonacci(Fibonomial coefficients+常系数线性递推)
题意{f0=0f1=1fn=fn−1+fn−2,n≥2\left\{\begin{matrix}f_0=0\\ f_1=1\\ f_n=f_{n-1}+f_{n-2},n\geq 2\end{matrix}\right.⎩⎨⎧f0=0f1=1fn=fn−1+fn−2,n≥2给你nnn和mmm求∑i=0nfim %1000000000\sum_{i=0}^{n}...原创 2019-08-18 13:43:17 · 393 阅读 · 0 评论