Euler_7.cpp (421B)
1 #include "Euler.h" 2 3 int Euler::Get10001stPrime() 4 { 5 bool is_prime; 6 7 int count = 2; //includes 2 & 3 8 9 for(int i = 5; count < 1000000; i += 2) 10 { 11 is_prime = true; 12 13 for(int j = 3; j * j <= i && is_prime; j += 2) 14 if(i % j == 0) is_prime = false; 15 16 if(is_prime) { 17 ++count; 18 19 if (count == 10001) 20 return i; 21 } 22 } 23 24 return 0; 25 }