ACM HDOJ 1715 (大菲波数)

题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=1715

import java.util.Scanner;import java.math.BigInteger;public class Main {public static void main(String[] args) {BigInteger fibonacci[] = new BigInteger[1001];fibonacci[0] = fibonacci[1] = BigInteger.ONE;for (int i = 2; i < 1001; ++i) {fibonacci[i] = fibonacci[i - 2].add(fibonacci[i - 1]);}Scanner scn = new Scanner(System.in);int casesNumber = scn.nextInt();while (0 <= --casesNumber) {System.out.println(fibonacci[scn.nextInt() - 1]);}scn.close();}}