Question

How to calculate the Nth prime number in C++

Answer 1

#include <iostream>
#include <cmath>

// 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73
 
bool isPrime(int n) {
    if (n == 0) return false;
    if (n == 1) return false;
   
    for (int i = 2; i <= sqrt(n); i++) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}
  
int getTheNthPrimeNumber(int N) {
    int i = 0;
    int prime = 2;
   
    while (i < N) {
        if (isPrime(prime)) {
            i++;
        }
        prime++;
    }
      
    return --prime;
}
   
int main(void) {
    std::cout << getTheNthPrimeNumber(11);
}

   
   
/*
run:
   
31
   
*/

 

70+ SQL courses for beginners and professionals