Solution to Prime Problem I presented at ID Tech Programming Academy

sum_primes.cpp

#include <iostream>
#include <vector>

using namespace std;

int i;
unsigned total;
vector<int> v = vector<int>();
vector<int>::iterator vi;

int main(int argc, char const *argv[])
{
    cout << sizeof(int) << endl << sizeof(unsigned) << endl;
    cout << "Solving problem: ";
    v.push_back(2);
    i = 3;
    total = 0;

    for( ; ; ) {
        for(vi = v.begin(); vi != v.end(); vi++) {
            if ((i % *vi) == 0) 
                goto skip;
        }
        v.push_back(i);
        // cout << i << endl;
        total += i;
        if (i  == 225287) {
            cout << total << endl;
            cout << v[v.size() - 1] << endl;
            return 0;
        }
        i++;
        continue;

        skip:
            i++;
            continue;
    }
    return 0;
}