Linear Recurrence f(n) = a*f(n-1) + b*f(n-2)
Medium
Matrix Exponentiation
Given a, b, f(0), f(1) and n, print f(n) modulo 1,000,000,007.
Constraints
0 <= a, b, f0, f1 < 10^9+7 0 <= n <= 10^18
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.