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

Added a benchmark tool

Browse Source
This commit is contained in:
Mattrixwv
2020-07-08 20:38:37 -04:00
parent a7d960c3b1
commit 766af92f1a
68 changed files with 546 additions and 134 deletions
Download Patch File Download Diff File Expand all files Collapse all files

84
main.cpp
View File

@@ -11,6 +11,7 @@
#include "Algorithms.hpp"
#include "Headers/Problem.hpp"
#include "Problems.hpp"
#include "ProblemSelection.hpp"
//Some helper functions to help with the menus
@@ -27,11 +28,6 @@ void listProblems(); //Lists the problem numbers that you can choose
//Setup the menu options
enum MenuOptions {SOLVE = 1, DESCRIPTION, LIST, EXIT, SIZE};
//Setup the problem numbers
std::vector<unsigned int> PROBLEM_NUMBERS = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
31, 67};
int main(){
int selection = 0; //Holds the menu selection of the user
@@ -111,60 +107,6 @@ void solveMenu(){
}
}
//This function returns a pointer to a problem of type number
Problem* getProblem(unsigned int problemNumber){
Problem* problem = nullptr; //Holds the problem we are about to create
//Decide which problem was asked for and create it
switch(problemNumber){
case 1 : problem = new Problem1; break;
case 2 : problem = new Problem2; break;
case 3 : problem = new Problem3; break;
case 4 : problem = new Problem4; break;
case 5 : problem = new Problem5; break;
case 6 : problem = new Problem6; break;
case 7 : problem = new Problem7; break;
case 8 : problem = new Problem8; break;
case 9 : problem = new Problem9; break;
case 10 : problem = new Problem10; break;
case 11 : problem = new Problem11; break;
case 12 : problem = new Problem12; break;
case 13 : problem = new Problem13; break;
case 14 : problem = new Problem14; break;
case 15 : problem = new Problem15; break;
case 16 : problem = new Problem16; break;
case 17 : problem = new Problem17; break;
case 18 : problem = new Problem18; break;
case 19 : problem = new Problem19; break;
case 20 : problem = new Problem20; break;
case 21 : problem = new Problem21; break;
case 22 : problem = new Problem22; break;
case 23 : problem = new Problem23; break;
case 24 : problem = new Problem24; break;
case 25 : problem = new Problem25; break;
case 26 : problem = new Problem26; break;
case 27 : problem = new Problem27; break;
case 28 : problem = new Problem28; break;
case 29 : problem = new Problem29; break;
case 30 : problem = new Problem30; break;
case 31 : problem = new Problem31; break;
case 67 : problem = new Problem67; break;
}
//Return the newly created problem
return problem;
}
void solveProblem(Problem* problem){
//Print the problem description
printDescription(problem);
//Solve the problem
problem->solve();
//Print the results
std::cout << problem->getString()
<< "\nIt took " << problem->getTime() << " to solve this problem.\n\n" << std::endl;
}
void descriptionMenu(){
Problem* problem = nullptr; //Holds the problem that will be generated
std::cout << "\n\n"; //Give some extra space to print the description
@@ -200,27 +142,3 @@ void descriptionMenu(){
problem = nullptr;
}
}
void printDescription(Problem* problem){
std::cout << problem->getDescription() << '\n';
}
unsigned int getProblemNumber(){
unsigned int problemNumber = 0;
std::cout << "Enter a problem number: ";
std::cin >> problemNumber;
while(!mee::isFound(PROBLEM_NUMBERS, problemNumber) || std::cin.fail()){
std::cout << "That is an invalid problem number!\nEnter a problem number: ";
std::cin.clear();
std::cin >> problemNumber;
}
return problemNumber;
}
void listProblems(){
std::cout << PROBLEM_NUMBERS[1];
for(unsigned int problemNumber = 2;problemNumber < PROBLEM_NUMBERS.size();++problemNumber){
std::cout << ", " << PROBLEM_NUMBERS[problemNumber];
}
std::cout << std::endl;
}