Fibonacci Again

CodeChefOpen on judge ↗

Today, Mr. Joseph, our maths professor, taught us about the Fibonacci sequence and its applications in various places. He concluded the lesson by giving us a computational problem, which he stated as simple. You are given two non-negative integers X and Y, you have to calculate the sum (F(X) + F(X + 1) + ... + F(Y)) mod 1000000007, where F(N)=F(N-1)+F(N-2),N>=2. Input The first line contains

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