import java.util.Scanner; import java.math.BigInteger; public class Main{ public static void main(String[] args){ final int max = 1001; Scanner cin = new Scanner(System.in); BigInteger f[] = new BigInteger[max]; int i; f[1] = f[2] = BigInteger.ONE; for(i = 3; i != max; ++i) f[i] = f[i - 1].add(f[i - 2]); int n = cin.nextInt(); while(n-- > 0){ i = cin.nextInt(); System.out.println(f[i]); } } }
10478014 | 2014-04-05 09:21:44 | Accepted | 1715 | 234MS | 5892K | 440 B | Java | 长木 |
HDU1715 大菲波数 【大数】,布布扣,bubuko.com
原文:http://blog.csdn.net/chang_mu/article/details/22977239