How to solve this Fibonacci Problem — FRSKH?

Revision en1, by -synx-, 2017-12-02 17:17:38

The problem requires to efficiently compute

The constraints are:

I have solved the easier version with constraint on and same constrains on
M can be optimized using Pisano Period
N can be optimized using Fast Doubling/Matrix Exponentiation
The issue is constraint on K, which I cant figure a way to optimize. How can we resolve this issue?

Tags fibonacci, recurrence, pisano


  Rev. Lang. By When Δ Comment
en1 English -synx- 2017-12-02 17:17:38 614 Initial revision (published)