题解 | 素数判断

import math


def is_prime(num):
    if num < 2:
        return False
    if num == 2:
        return True
    if num % 2 == 0:
        return False
    for i in range(3, int(math.sqrt(num)) + 1, 2):
        if num % i == 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")