ProjectEuler/ProjectEulerCPP
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulercpp.git synced 2025-12-06 17:13:59 -05:00
Code Issues Packages Projects Releases Wiki Activity

Updated how results are retrieved

Browse Source
This commit is contained in:
Mattrixwv
2020-07-20 00:53:08 -04:00
parent 22871b71e9
commit 2616dabe6d
67 changed files with 132 additions and 434 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
Source/Problem27.cpp
View File

@@ -70,6 +70,11 @@ void Problem27::solve(){
//Stop the timer
timer.stop();
//Save the results
result << "The greatest number of primes found is " << topN
<< "\nIt was found with A = " << topA << ", B = " << topB
<< "\nThe product of A and B is " << topA * topB;
//Throw a flag to show the problem is solved
solved = true;
}
@@ -81,21 +86,6 @@ void Problem27::reset(){
primes.clear();
}
//Return a string with the solution to the problem
std::string Problem27::getString() const{
//If the problem hasn't been solved throw an exception
if(!solved){
throw Unsolved();
}
std::stringstream results;
results << "The greatest number of primes found is " << topN
<< "\nIt was found with A = " << topA << ", B = " << topB
<< "\nThe product of A and B is " << topA * topB;
return results.str();
}
//Returns the top A that was generated
int64_t Problem27::getTopA() const{
//If the problem hasn't been solved throw an exception