Project Euler – Problem 7

Problem 7: Find the 10001st prime.

#include 
#include 
 
using namespace std;
 
bool isPrime(int n){
        long sqr = sqrt(n)+1;
        for(int i=2; i
Post a comment | Trackback URI