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
Archit Jain:
2014-07-03 09:49:39
nice problem Last edit: 2014-07-03 09:49:53 |
|
excursionist:
2014-06-13 00:10:15
nice problem....taught many things :o
|
|
Sharprocks:
2014-06-07 22:00:48
Nice question
|
|
saanc:
2014-05-19 06:41:42
can't believe that it is accepted in 1st go.. yepppeeeeeeeeeeeeeeee |
|
sarelfeniel:
2014-04-22 06:07:29
Great problem! I am content with 0.02 but I highly recommend reading the forum thread by Rafael Perrella. I guarantee you will learn something. Definitely never knew about that secret of the Fibonacci numbers.
|
|
Francis:
2014-04-07 11:01:12
hi,all! I am stuck here and I need help! Thanks so much in advance.
|
|
Alexandre Henrique Afonso Campos:
2013-11-11 23:39:41
I have a solution that works for all listed cases here and in the forums previously mentioned here in the comments, including trick cases. Still getting WA.
|
|
Rafael Perrella:
2013-09-11 22:43:50
I don't know any link where it is discussed. But you can start a thread and post the link here, then we can discuss it there.
|
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 |