Java 编程实现斐波那契数列中第 N 个合数

import java.util.Scanner;

public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] fib = new int[35]; int[] prime = new int[35]; fib[1] = 1; fib[2] = 1; int cnt = 0; for (int i = 3; i <= 30; i++) { fib[i] = fib[i - 1] + fib[i - 2]; if (isPrime(fib[i]) == false && fib[i] % 5 != 0) { prime[++cnt] = fib[i]; } } System.out.println(prime[n]); }

public static boolean isPrime(int n) {
    if (n <= 1) {
        return false;
    }
    for (int i = 2; i <= Math.sqrt(n); i++) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

}