UVA10870 Recurrences 题解

题目传送门前置知识矩阵加速递推解法直接递推显然不可做，考虑矩阵加速递推。令 \(F_{n}=\begin{bmatrix} f_{n} & f_{n+1} & f_{n+2} & \dots & f_{n+d-1} \end{bmatrix}\)，容易有 \(\begin{aligned}