|非正经题解|求第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 (true) {
        if (isPrime(num)) {
            ++count;
            if (count == n) {
                return num;
            }
        }
        ++num;
    }
}
int main() {
    int n;
    cin >> n;
    cout<<findNthPrime(n)<<endl;
    return 0;
}