素数的判定（常规）

#include <iostream>#include <set>#include <map>#include <stack>#include <cmath>#include <queue>#include <cstdio>#include <bitset>#include <string>#include <vector>#include <iomanip>#include <cstring>#include <algorithm>#include <functional>#include <ctime>#define PI acos(-1)#define eps 1e-8#define inf 0x3f3f3f3f#define debug(x) cout<<"---"<<x<<"---"<<endltypedef long long ll;using namespace std;//素数的判定int dd(int x){    if (x <= 1)    {        return 0;    }    int i, m = floor(sqrt(x) + 0.5);    for (i = 2; i <= m; i++)        if (x % i == 0)        {            return 0;        }    return 1;}int main(){    int n;    while (cin >> n)    {        if (dd(n))        {            cout << "True" << endl;        }        else        {            cout << "False" << endl;        }    }    return 0;}