题解 | 素数判断

import math
def is_prime(n):
    if n <= 1:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3,int(math.sqrt(n)+1),2):
        if n % i == 0:
            return False
    return True

T = int(input())
for _ in range(T):
    a = int(input())
    print("Yes" if is_prime(a) else "No")