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

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

bool isPrime(int num) {
    int i;
    bool flag = true;

    for (i = 2; i < sqrt(num); i++) {
        if (num % i == 0) {
            flag = false;
        }
    }

    return flag;
}

int main() {

    // write your code here......
    int n;

    cin >> n;

    if (isPrime(n)) {
        cout << "是质数" << endl;
    } else {
        cout << "不是质数" << endl;
    }


    return 0;
}