题解 | #判断一个数是不是质数#

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

int main() {

    // write your code here......
    long long n;
    bool isPrime = true;
    cin >> n;
    for (int i=2; i<sqrt(n); i++){
        if (n%i == 0)
            isPrime = false;
    }
    if (isPrime==true)
        cout << "是质数" << endl;
    else
        cout << "不是质数" << endl;
    return 0;
}