Sicily 1561. PRIME

// Problem#: 1561// Author#: Reid Chan#include <iostream>#include <cmath>using namespace std;bool isPrime(int n){    for (int i = 2; i <= sqrt(n); ++i) {        if (n % i == 0) {            return false;        }    }    return true;}int main() {    int num, count = 0;    cin >> num;    int i;    for (i = 2; count != num; ++i) {        if (isPrime(i)) {            count++;        }    }    cout << i - 1 << endl;    return 0;}