|
||||||||||
Sum of Tribonacci NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 914 Accepted Submission(s): 340 Problem Description Everybody knows Fibonacci numbers, now we are talking about the Tribonacci numbers: T[0] = T[1] = T[2] = 1; T[n] = T[n - 1] + T[n - 2] + T[n - 3] (n >= 3) Given a and b, you are asked to calculate the sum from the ath Fibonacci number to the bth Fibonacci number, mod 1,000,000,007, that is (T[a] + T[a + 1] + ... + T[b]) % 1,000,000,007. Input There are multiple cases (no more than 100). Each case contain two non-negative integers a b(a <= b and a, b < 1,000,000,000) Output For each case, output the sum % 1,000,000,007. Sample Input
Sample Output
Author hhanger@zju Source | ||||||||||
|