Practice · 1 of 5

Fibonacci Modulo

CHALLENGE

Difficulty: intermediate+25 XP

**Description:** Print F(n) modulo 10^9 + 7 where F(0) = 0, F(1) = 1. **Input:** One line: n (0 <= n <= 100000). **Output:** One integer — F(n) mod 10^9 + 7. **Example:** 10 -> 55.

Press Submit to check your solution.

Back to lesson: Practice: Dynamic Programming Problem Set