PAT 天梯赛 L1-028. 判断素数 【水】

题目链接

https://www.patest.cn/contests/gplt/L1-028

AC代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>
using namespace std;

typedef long long LL;
const double PI = 3.14159265358979323846264338327;
const double E = 2.718281828459;
const double eps = 1e-6;
const int MAXN = 0x3f3f3f3f;
const int MINN = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;
int isPrime(int x){
    int flag;
    int n,m;
    if(x<=1)
            flag=0;
        else if(x==2||x==3)
            flag=1;
        else if(x%2==0)
            flag=0;
        else{
            m=sqrt(x)+1;
            for(n=3;n<=m;n+=2){
                if(x%n==0){
                    flag=0;
                    break;
            }
                else{
                   flag=1;
                }
            }
        }
    return flag;
}

int main()
{
    int n;
    cin >> n;
    int num;
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &num);
        if (isPrime(num))
            cout << "Yes\n";
        else
            cout << "No\n";
    }
}