Fibonacci Numbers

CSESMathematicsOpen on judge ↗

The Fibonacci numbers can be defined as follows: - F_0=0 - F_1=1 - F_n = F_{n-2}+F_{n-1} Your task is to calculate the value of F_n for a given n. Input The only input line has an integer n. Output Print the value of F_n modulo 10^9+7. Constraints - 0 \le n \le 10^{18} Example Input: 10 Output: 55

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI