Submission #4027755

---

Source Code Expand

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

public class Main {

    public static void main(String[] args) {
        try (Scanner scanner = new Scanner(System.in)) {
            int n = scanner.nextInt();
            BigInteger a1 = BigInteger.ZERO;
            BigInteger a2 = BigInteger.ZERO;
            BigInteger a3 = BigInteger.ONE;
            BigInteger result = null;
            if (n > 3) {
                BigInteger[] tribonattiArray = new BigInteger[n];
                tribonattiArray[0] = a1;
                tribonattiArray[1] = a2;
                tribonattiArray[2] = a3;
                for (int i = 3; i < n; i++) {
                    tribonattiArray[i] = tribonattiArray[i - 1].add(tribonattiArray[i - 2]).add(tribonattiArray[i - 3]);
                }
                BigInteger n10007 = BigInteger.valueOf(10007);
                System.out.println( tribonattiArray[n - 1].compareTo(n10007) < 0 ? tribonattiArray[n - 1] : tribonattiArray[n - 1].remainder(n10007));
            } else {
                switch (n) {
                case 1:
                    result = a1;
                    break;
                case 2:
                    result = a2;
                    break;
                case 3:
                    result = a3;
                    break;
                default:
                    break;
                }
            }
            System.out.println(result);

        }

    }

}

Submission Info

Judge Result