Fibonacci Modified | Editorial by aksingh007

Use BigInteger class to solve this problem.
```
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    public static void main(String args[] ) throws Exception {
        Scanner sc=new Scanner(System.in);
        int t1=sc.nextInt();
        int t2=sc.nextInt();
        int n=sc.nextInt();
        /*BigInteger a=new BigInteger(""+t1);
        BigInteger b=new BigInteger(""+t2);
        BigInteger res=new BigInteger("0");
        
        for(int i=3;i<=n;i++){
            BigInteger next=new BigInteger("0");
            BigInteger p=new BigInteger(""+b.multiply(b));
            next=next.add(a.add(p));
            System.out.println(p+" "+next);
            res=res.add(new BigInteger(""+next));
            a=a.add(a.negate());
            a.add(b);
            b.add(b.negate());
            b.add(res);
            //a=b;
            //b=p;
            res=res.add(res.negate());
        }*/
        BigInteger[] arr=new BigInteger[n];
        //arr[0]=arr[0].add(""+t1);
        //arr[1]=arr[1].add(""+t2);
        arr[0]=new BigInteger(""+t1);
        arr[1]=new BigInteger(""+t2);
        for(int i=2;i<n;i++)
            arr[i]=new BigInteger(""+(arr[i-2]).add((arr[i-1]).pow(2)));
            //arr[i]=arr[i-1].add(arr[i-2]);
        
      System.out.println(arr[n-1]);
    }
}

```

Fibonacci Modified | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?