题解 | 素数判断

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while(in.hasNextInt()){
             int T = in.nextInt(); 
        for (int i = 0; i < T; i++) {
            int num = in.nextInt(); 
            if (isPrime(num)) {
                System.out.println("Yes"); 
            } else {
                System.out.println("No");  
            }
        }
        }
        in.close();
    }
    public static boolean isPrime(int n) {
        if (n <= 1) return false;
        if (n == 2) return true;
        if (n % 2 == 0) return false;
        for (int i = 3; i * i <= n; i += 2) {
            if (n % i == 0) return false;
        }
        return true;
    }
}