题解 | 素数判断

import math

def is_prime(n: int) -> bool:
    if n<2:
        return False
    if n%2==0:
        return n==2
    r = math.isqrt(n)
    for i in range(3,r+1,2):
        if n%i==0:
            return False
    return True
    

T = int(input())
for i in range(T):
    n = int(input())
    print('Yes' if is_prime(n) else "No")