Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Måste kompileras med -std=c++11
- #include <iostream>
- #include <vector>
- #include <cmath>
- #include <cstdlib>
- using namespace std;
- int main(int argc, char* argv[]) {
- if(argc < 2) {
- cerr << "Must specify max" << endl;
- return -1;
- } else if(argc > 2) {
- cerr << "Too many arguments" << endl;
- return -1;
- }
- const auto MAX = atoi(argv[1]); // Programmet hittar all primtal under MAX
- vector<int> primes;
- cout << MAX << endl;
- for(auto i = 2; i < MAX; i++) {
- auto divisible = false;
- const auto ROOT = sqrt(i);
- for(const auto &j: primes) { // Testar talet mot alla tidigare primtal
- if(j > ROOT) {
- break;
- }
- if(!(i % j)) { // Testar om talet är delbart
- divisible = true;
- break;
- }
- }
- if(!divisible) { // Hittat ett primtal
- primes.push_back(i);
- cout << i << endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement