Problem
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.
Code
#include <iostream>
#include <vector>
using namespace std;
bool isPrime(int n)
{
if(n < 2) return false;
for(int i = 3; i*i <= n; i+=2)
if(n%i == 0) return false;
return true;
}
int main()
{
long long sum = 2;
for (int i = 3; i < 2000000; i+=2)
{
if (isPrime(i))
{
sum += i;
}
}
cout << sum << endl;
}