LinAGPrime-C++98

#include <iostream>
#include <vector>
#include <cmath>
#include <cstdlib>

using namespace std;

int main(int argc, char* argv[]) {
    if(argc < 2) {
        cerr << "Must specify max, e.g. \"" << argv[0] << " 10000000\"" << endl;
        return -1;
    } else if(argc > 2) {
        cerr << "Too many arguments" << endl;
        return -1;
    }

    const int MAX = atoi(argv[1]); // Programmet hittar all primtal under MAX
    vector<int> primes;

    for(int i = 2; i < MAX; i++) {
        bool divisible = false;
        const double ROOT = sqrt(i);

        for(int j = 0; j < primes.size(); j++) {
            if(primes.at(j) > ROOT) break;
            if((i % primes.at(j)) == 0) { // Testar om talet är delbart
                divisible = true;
                break;
            }
        }

        if(not divisible) { // Hittat ett primtal
            primes.push_back(i);
            cout << i << endl;
        }
    }

    return 0;
}