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 solution to problem 36

Browse Source
This commit is contained in:
Mattrixwv
2021-06-29 12:03:49 -04:00
parent 240b7b6271
commit ebdb92dc2f
6 changed files with 171 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
headers/ProblemSelection.hpp
View File

@@ -61,6 +61,7 @@
#include "Problems/Problem33.hpp"
#include "Problems/Problem34.hpp"
#include "Problems/Problem35.hpp"
#include "Problems/Problem36.hpp"
#include "Problems/Problem67.hpp"
@@ -68,7 +69,7 @@
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, 32, 33, 34, 35, 67};
31, 32, 33, 34, 35, 36, 67};
//This function returns a pointer to a problem of type number
Problem* getProblem(unsigned int problemNumber){
@@ -111,6 +112,7 @@ Problem* getProblem(unsigned int problemNumber){
case 33 : problem = new Problem33; break;
case 34 : problem = new Problem34; break;
case 35 : problem = new Problem35; break;
case 36 : problem = new Problem36; break;
case 67 : problem = new Problem67; break;
}

2
headers/Problems/Problem35.hpp
View File

@@ -47,7 +47,7 @@ public:
virtual void solve(); //Solve the problem
virtual void reset(); //Reset the problem so it can be run again
//Gets
virtual std::string getResult(); //Returns a string with the solutino to the problem
virtual std::string getResult(); //Returns a string with the solution to the problem
std::vector<int> getPrimes(); //Returns the vector of primes < MAX_NUM
std::vector<int> getCircularPrimes(); //Returns the vector of circular primes < MAX_NUM
int getNumCircularPrimes(); //Returns the number of circular primes

60
headers/Problems/Problem36.hpp Normal file
View File

@@ -0,0 +1,60 @@
//ProjectEuler/ProjectEulerCPP/headers/Problems/Problem36.hpp
//Matthew Ellison
// Created: 06-29-21
//Modified: 06-29-21
//Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
/*
Copyright (C) 2021 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 <https://www.gnu.org/licenses/>.
*/
#ifndef PROBLEM36_HPP
#define PROBLEM36_HPP
#include <string>
#include <vector>
#include "Problem.hpp"
#include "Algorithms.hpp"
class Problem36 : public Problem{
private:
//Variables
//Static variables
static int MAX_NUM; //The largest number that will be checked
//Instance variables
std::vector<int> palindromes; //All numbers that are palindromes in base 10 and 2
int sum; //The sum of all elements in the vector palindromes
public:
//Constructor
Problem36();
//Operational functions
virtual void solve(); //Solve the problem
virtual void reset(); //Reset the problem so it can be run again
//Gets
virtual std::string getResult(); //Returns a string with the solution to the problem
std::vector<int> getPalindromes(); //Return the vector of palindromes < MAX_NUM
int getSumOfPalindromes(); //Return the sum of all elements in the vector of palindromes
};
/* Results:
The sum of all base 10 and base 2 palindromic numbers < 999999 is 872187
It took an average of 22.578 milliseconds to run this problem over 100 iterations
*/
#endif //PROBLEM36_HPP

2
makefile
View File

@@ -3,7 +3,7 @@ NUMCORESWIN = ${NUMBER_OF_PROCESSORS}
LIBFLAGS = -shared -std=c++17 -O3 -fPIC -Wall
EXEFLAGS = -Wall -std=c++17 -O3 -Wl,-rpath,'$$ORIGIN/lib'
LINKEDLIBS = -lgmp -lgmpxx
PROBLEM_NUMBERS = 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 32 33 34 35 67
PROBLEM_NUMBERS = 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 32 33 34 35 36 67
SOURCE_DIR = src
PROBLEM_DIR = $(SOURCE_DIR)/Problems
INCLUDE_DIR = headers

1
src/Problems/Problem35.cpp
View File

@@ -25,6 +25,7 @@
#include <string>
#include <sstream>
#include <vector>
#include "Problems/Problem35.hpp"
#include "Algorithms.hpp"

105
src/Problems/Problem36.cpp Normal file
View File

@@ -0,0 +1,105 @@
//ProjectEuler/ProjectEulerCPP/src/Problems/Problem36.cpp
//Matthew Ellison
// Created: 06-29-21
//Modified: 06-29-21
//Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
/*
Copyright (C) 2021 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 <https://www.gnu.org/licenses/>.
*/
#include <string>
#include <sstream>
#include <vector>
#include "Problems/Problem36.hpp"
#include "Algorithms.hpp"
#include <iostream>
//The largest number that will be checked
int Problem36::MAX_NUM = 999999;
//Constructor
Problem36::Problem36() : Problem("Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2."), sum(0){
}
//Operational functions
//Solve the problem
void Problem36::solve(){
//If the problem has already been solved do nothing and end the function
if(solved){
return;
}
//Start the timer
timer.start();
//Start with 1, check if it is a palindrome in base 10 and 2, and continue to MAX_NUM
for(int num = 1;num < MAX_NUM;++num){
//Check if num is a palindrome
if(mee::isPalindrome(std::to_string(num))){
//Convert num to base 2 and see if that is a palindrome
std::string binNum = mee::toBin(num);
if(mee::isPalindrome(binNum)){
//Add num to the vector of palindromes
palindromes.push_back(num);
}
}
}
//Get the sum of all palindromes in the vector
sum = mee::getSum(palindromes);
//Stop the timer
timer.stop();
//Throw a flag to show the problem is solved
solved = true;
}
//Reset the problem so it can be run again
void Problem36::reset(){
Problem::reset();
palindromes.clear();
sum = 0;
}
//Gets
//Returns a string with the solution to the problem
std::string Problem36::getResult(){
//If the problem hasn't been solved throw an exception
if(!solved){
throw Unsolved();
}
std::stringstream result;
result << "The sum of all base 10 and base 2 palindromic numbers < " << MAX_NUM << " is " << sum;
return result.str();
}
//Return the vector of palindromes < MAX_NUM
std::vector<int> Problem36::getPalindromes(){
//If the problem hasn't been solved throw an exception
if(!solved){
throw Unsolved();
}
return palindromes;
}
//Return the sum of all elements in the vector of palindromes
int Problem36::getSumOfPalindromes(){
//If the problem hasn't been solved throw an exception
if(!solved){
throw Unsolved();
}
return sum;
}