ACM-XZNU-1124 菲波那契据数列(2) java 解题报告

ACM-XZNU-1124 菲波那契数列(2) java 解题报告

?

1124:菲波那契数列(2)

• import java.util.Scanner;public class Main {public static int[] feibo = new int[1000001];public static void main(String[] args) {feibo[1] = 1;feibo[2] = 1;for (int i = 3; i <= 1000000; i++) {feibo[i] = (feibo[i-1]+feibo[i-2])%1000;}Scanner sc = new Scanner(System.in);int n = sc.nextInt();for (int i = 0; i < n; i++) {int m = sc.nextInt();System.out.println(feibo[m]);}}}?这题有很大的数据所以不能硬来，只能逐步求出余数用空间换取时间

  ?