CLASSICSEQ - Classic Sequence Sum
Find the value of sum of square of all the first N numbers in Fibonacci series.
First line of every input test file contains T denoting the number of test cases for the file, followed by T numbers N.
For every number N output the result( sum of square of first N fib, number) in the below described format.
Value can overflow the standard data type, output the result modulo 1000000007 (109 + 7).
1 <= T <= 10000 (104)
1 <= N <= 1000000000000000000 (1018)
Output: Case 1: 1
Case 2: 40
Case 3: 4895
Thanks [Lakshman] for suggesting right place.
I don't think this problem is relevant to the classical section. Should be moved to TutorialsLast edit: 2018-10-20 20:35:37