Project Euler #10

Euler10

#include <iostream>
#include <vector>

using namespace std;

int main()
{
    // Find the sum of the primes less than 2000000

    vector<int> primes;
    primes.push_back(2);
    int maxprime = 2000000;
    int primesize = primes.size();
    int newprime;
    int j;

    for (int i = 2; i < maxprime; i++){
        j = 0;
        newprime = 1;
        while (j < primesize) {
            if (i % primes[j] == 0) {
                // i % j is the remainder of i/j
                newprime = 0;
            }
            j++;
        }
        if (newprime == 1) {
            primes.push_back(i);
            cout << i << endl;
        }
        primesize = primes.size();
    }

    primesize = primes.size();
    long long sum = 0;
    for (int i = 0; i < primesize; i++){
        //cout << primes[i] << endl;
        sum += primes[i];
    }

    cout << "The sum of the primes less than " << primes[primesize-1] << " is " << sum << endl;

    return 0;
}