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
hrsh_sengar:
2018-03-14 19:57:24
My 101th :)
|
|
m2do:
2018-01-10 19:48:53
Matrix Exponentiation it is! :) |
|
rohansaraf033:
2017-12-24 21:40:59
Learnt matrix expo:
|
|
chetan4060:
2017-12-19 13:08:46
AC in one go:-) |
|
sandeep_123:
2017-12-14 21:46:06
Matrix exponentiation and f(1)+f(2)+f(3)+... + f(n) = f(n+2)-1 did this :D !!
|
|
sirjan13:
2017-10-08 19:06:09
Matrix Expo :) |
|
babur:
2017-08-23 14:38:43
AC after 1 wa....take care of negative modulus..
|
|
swarup03:
2017-07-14 08:55:24
Ac in one go :)
|
|
sandeep_4141:
2017-06-23 10:31:35
learn something new !! Matrix exponentiation !!
|
|
anurag44:
2017-06-14 22:46:36
use long long !! Cost me 3WA's |
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 |