原题链接
import java.util.Scanner;//导入Scanner类
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[] arr = new int[1000010];
int n = sc.nextInt();
arr[0]=arr[1]=1;
for (int i = 2; i < n; i++) {
arr[i]=(arr[i-1]+arr[i-2])%10007;
}
sc.close();
System.out.print(arr[n-1]);
}
}
转载于:https://www.cnblogs.com/ruoh3kou/p/9948700.html
相关资源：蓝桥杯Fibonacci数列
