Fibonacci for biginteger

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

public class FibonacciRecursion {

    public static BigInteger fibonacci(int n) {
        if (n == 1 || n == 2) {
            return BigInteger.ONE;

        }else if(n==0){
            return BigInteger.ZERO;
        }
        else {
            return (fibonacci(n - 1).add(fibonacci(n - 2)));
        }

    }


    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        BigInteger ans = fibonacci(n);
        System.out.println(ans);
    }

}

Similar codes

0 vote110 views1 answer
Spigot disable health regeneration
Java
1 vote177 views1 answer
How to make priority queue of pairs in java
Java
0 vote152 views1 answer
Original authors: Talmon Marco, Igor Magazinnik Programming languages: Java, C, Python, C , Qt, Objective-C
Java
1 vote126 views3 answers
Convert from java to kotlin online
Java
0 vote126 views2 answers
Bukkit detect block that nowbal hit
Java
1 vote126 views2 answers
Java get distinct values from list
Java
0 vote122 views1 answer
Java backtracking
Java
1 vote116 views1 answer
Int a=08 java
Java
0 vote113 views1 answer
Find number of occurrences of a substring in a string java
Java
1 vote115 views1 answer
Concatenate two arrays java
Java