//ProjectEuler/C++/Source/Problem7.cpp //Matthew Ellison // Created: 09-28-18 //Modified: 07-14-19 //What is the 10001th prime number? //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 #include "Stopwatch.hpp" #include "Algorithms.hpp" #include "../Headers/Problem.hpp" #include "../Headers/Problem7.hpp" uint64_t Problem7::NUMBER_OF_PRIMES = 10001; Problem7::Problem7() : Problem("What is the 10001th prime number?"){ } void Problem7::solve(){ //If the problem has already been solved do nothing and end the function if(solved){ return; } //Start the timer timer.start(); //Get the correct number of prime numbers primes = mee::getNumPrimes(NUMBER_OF_PRIMES); //Stop the timer timer.stop(); //Throw a flag to show the problem is solved solved = true; } std::string Problem7::getString() const{ //If the problem hasn't been solved throw an exception if(!solved){ throw unsolved(); } std::stringstream results; results << "The " << NUMBER_OF_PRIMES << "th prime number is " << primes.at(primes.size() - 1); return results.str(); } uint64_t Problem7::getPrime() const{ //If the problem hasn't been solved throw an exception if(!solved){ throw unsolved(); } return *primes.end(); } void Problem7::reset(){ Problem::reset(); }