Given terms and where , term is computed using the following relation:
For example, if term and , term , term , term , and so on.
Given three integers, , , and , compute and print term of a modified Fibonacci 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 be more creative in your solution to compensate for the limitations of your chosen submission language.
A single line of three space-separated integers describing the respective values of , , and .
may far exceed the range of a -bit integer.
Print a single integer denoting the value of term in the modified Fibonacci sequence where the first two terms are and .
0 1 5
The first two terms of the sequence are and , which gives us a modified Fibonacci sequence of . Because , we print term , which is .