题解 | 素数判断

#include <iostream>
#include <cmath>
using namespace std;

int is_prime(int x)
{
    if (x <= 1) return 0;
    if (x == 2) return 1;
    if (x % 2 == 0) return 0;

    for (int i = 3;i <= sqrt(x);i += 2)
    {
        if (x % i == 0)
        {
            return 0;
        }
    }
    return 1;
}

int main()
{
    int T;
    cin >> T;

    for (int i = 0;i < T;i++)
    {
        int temp;
        cin >> temp;

        if (is_prime(temp) == 1)
        {
            cout << "Yes" << '\n';
        }
        else
        {
            cout << "No" << '\n';
        }
    }
}