- Dynamic Programming
- Fibonacci Modified
Implement a modified Fibonacci sequence using the following definition:
Given terms and where , term is computed as:
Given three integers, , , and , compute and print the term of a modified Fibonacci sequence.
Complete the fibonacciModified function in the editor below. It must return the number in the sequence.
fibonacciModified has the following parameter(s):
- int t1: an integer
- int t2: an integer
- int n: the iteration to report
- int: the number in the sequence
Note: The value of may far exceed the range of a -bit integer. Many submission languages have libraries that can handle such large results but, for those that don't (e.g., C++), you will need to compensate for the size of the result.
A single line of three space-separated integers, the values of , , and .
- may far exceed the range of a -bit integer.
0 1 5
The first two terms of the sequence are and , which gives us a modified Fibonacci sequence of . The term is .