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.

Example


Return .

Function Description

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

Returns

  • 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.

Input Format

A single line of three space-separated integers, the values of , , and .

Constraints

  • may far exceed the range of a -bit integer.

Sample Input

0 1 5

Sample Output

5

Explanation

The first two terms of the sequence are and , which gives us a modified Fibonacci sequence of . The term is .

Line: 1 Col: 1
  1. Challenge Walkthrough
    Let's walk through this sample challenge and explore the features of the code editor.1 of 6
  2. Review the problem statement
    Each challenge has a problem statement that includes sample inputs and outputs. Some challenges include additional information to help you out.2 of 6
  3. Choose a language
    Select the language you wish to use to solve this challenge.3 of 6
  4. Enter your code
    Code your solution in our custom editor or code in your own environment and upload your solution as a file.4 of 6
  5. Test your code
    You can compile your code and test it for errors and accuracy before submitting.5 of 6
  6. Submit to see results
    When you're ready, submit your solution! Remember, you can go back and refine your code anytime.6 of 6
  1. Check your score