C++ 查找第 N 个素数

#include <iostream>
using namespace std;

bool isPrime(int num) {
    if (num < 2) {
        return false;
    }
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) {
            return false;
        }
    }
    return true;
}

int findNthPrime(int n) {
    int count = 0;
    int num = 2;
    while (count < n) {
        if (isPrime(num)) {
            count++;
        }
        num++;
    }
    return num - 1;
}

int main() {
    int n;
    cin >> n;
    int nthPrime = findNthPrime(n);
    cout << nthPrime << endl;
    return 0;
}