FIBOSUM - Fibonacci Sum
The Fibonacci sequence is defined by the following relation:
- F(0) = 0
- F(1) = 1
- F(N) = F(N - 1) + F(N - 2), N >= 2
Your task is very simple. Given two non-negative integers N and M, you have to calculate the sum (F(N) + F(N + 1) + ... + F(M)) mod 1000000007.
Input
The first line contains an integer T (the number of test cases). Then, T lines follow. Each test case consists of a single line with two non-negative integers N and M.
Output
For each test case you have to output a single line containing the answer for the task.
Example
Input: 3 0 3 3 5 10 19 Output: 4 10 10857
Constraints
- T <= 1000
- 0 <= N <= M <= 109
hide comments
abhi_vicky:
2016-02-24 21:16:50
It is possible in C #Vmcode by using matrix exponantion and sum of fibonacci series!!!!AC in 0.01s |
|
minhthai:
2016-02-24 13:12:19
that negative modulo tho ( ͡° ͜ʖ ͡°) |
|
buvaneish:
2016-01-10 16:59:05
i am getting nzec error by pyth 2.7 please help me out it says"maximum recursion depth reached" |
|
Vmcode:
2015-12-08 15:59:13
how is it possible in c??? |
|
MishThi:
2015-09-14 07:36:45
4 Days !! And victory.. :D
|
|
Harsh Vardhan Ladha:
2015-09-06 16:11:18
it is not given that M>=N causing many to get negative and negative MOD problem.
|
|
satya_jha123:
2015-08-26 14:17:46
i wrote the code for this and i am gettingb negative ans so how do i handle this part
|
|
offson:
2015-08-23 23:11:22
@Babu, if you do sum(M) - sum(N - 1), the latter one can be bigger than the former due to the modulus application. To solve that, just sum 10^9 + 7 to the result while it is negative. |
|
Babu:
2015-07-26 21:37:47
where is the negative modulus coming .
|
|
Rahul Jain:
2015-07-18 20:39:57
@xxbloodysantaxx, Your comment was very helpful to me. Thanks.
|
Added by: | David Gómez |
Date: | 2010-12-04 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | My Own |