Fibonacci数列

package pracrice;


import java.util.Scanner;


public class ll {
@SuppressWarnings("resource")
public static void main(String[] args){
Scanner scanner = new Scanner(System.in);
int m = scanner.nextInt();
int arr[] = new int[2000000000];  
   arr[1] = arr[2] = 1;  
       for (int i = 3; i <=m; i++) 
       {  
          arr[i] = (arr[i - 1] + arr[i - 2]) % 10007;  
         
       }
System.out.println(arr[m]);  
     
         
}
}
// 数组的遍历  输出格式的控制

你可能感兴趣的:(蓝桥杯)