题解 | 素数判断

import math


def is_prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False
    for k in range(5, math.isqrt(n) + 1, 6):
        if n % k == 0 or n % (k + 2) == 0:
            return False
    return True
T = int(input())
for i in range(T):
    n = int(input())
    if is_prime(n):
        print("Yes")
    else:
        print("No")