//ProjectEuler/C++/Source/Problem10.cpp //Matthew Ellison // Created: 09-28-18 //Modified: 07-14-19 //Find the sum of all the primes below two million //Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses /* Copyright (C) 2019 Matthew Ellison This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this program. If not, see . */ #include #include #include #include "Stopwatch.hpp" #include "Algorithms.hpp" #include "../Headers/Problem.hpp" #include "../Headers/Problem10.hpp" uint64_t Problem10::GOAL_NUMBER = 2000000; Problem10::Problem10() : Problem("Find the sum of all the primes below two million"), sum(0){ } void Problem10::solve(){ //If the problem has already been solved do nothing and end the function if(solved){ return; } //Start the timer timer.start(); //Get the sum of all prime numbers < GOAL_NUMBER sum = mee::getSum(mee::getPrimes(GOAL_NUMBER - 1)); //Subtract 1 because it is supposed to be < 2000000 //Stop the timer timer.stop(); //Throw a flag to show the problem is solved solved = true; } std::string Problem10::getString() const{ //If the problem hasn't been solved throw an exception if(!solved){ throw unsolved(); } std::stringstream results; results << "The sum of all the primes less than " << GOAL_NUMBER << " is " << sum; return results.str(); } uint64_t Problem10::getSum() const{ //If the problem hasn't been solved throw an exception if(!solved){ throw unsolved(); } return sum; } void Problem10::reset(){ Problem::reset(); sum = 0; }