import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int n=scanner.nextInt();
int[] arr=new int[1000000];
arr[1]=1;
arr[2]=1;
if(n>=1 && n<=1000000) {
if(n==1||n==2)
System.out.println(1%10007);
else {
for(int i=3;i<=n;i++){
arr[i]=(arr[i-2]+arr[i-1])%10007;
}
System.out.println(arr[n]);
}
}
scanner.close();
}
}
Fibonacci数列
最新推荐文章于 2021-11-22 13:47:49 发布