Linear constant coefficient recursive - On how quickly memorizing formulas
Rote × 1
https://www.luogu.org/blog/ShadowassIIXVIIIIV/solution-p4723
Given \ (K, m \) , the sequence \ (F \) and \ (G \) , satisfies \ (f (n) = \ sum_ {i = 0} ^ {m-1} f (ni-1 ) G (i) \) .
Give constant \ (F (0), F (. 1), \ cdots, F (. 1-m) \) , seeking \ (F (K) \) .
\ (K \ leq 10 ^ {18}, m \ leq 20000 \)
Transfer matrix is set \ (A \) , configured \ (C \) such that \ (A ^ k = \ sum_ {i = 0} ^ {m-1} c (i) A ^ i \)
那么\(f(k)=\sum_{i=0}^{m-1}c(i)f(i)\)。
\ (C \) is configured: \ (n-C = A ^ \ MOD G (A) \) . Note now polynomial \ (X \) is the \ (A \) , so the polynomial \ (A = x \)
\ (G \) credited directly Conclusion: \ (G = -g ^ X ^ R & lt m + \)