Cerinta completa

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 .

Limbajul de programare folosit: java8

Cod:

import java.math.BigInteger;
import java.util.Scanner;

public class Solution {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		BigInteger prev = new BigInteger(in.next());
		BigInteger current = new BigInteger(in.next());
		int N = in.nextInt();
		for (int i = 0; i < N - 2; i++) {
			BigInteger next = prev.add(current.multiply(current));
			prev = current;
			current = next;
		}
		System.out.println(current);

		in.close();
	}
}

Scor obtinut: 1.0

Submission ID: 464603374

Link challenge: https://www.hackerrank.com/challenges/fibonacci-modified/problem

Fibonacci Modified