Updated to work with the new libraries

headers/Problems/Problem36.hpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem36.hpp
 //Matthew Ellison
 // Created: 06-29-21
-//Modified: 06-29-21
+//Modified: 07-02-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
 /*
@@ -20,7 +20,6 @@
 	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
 
@@ -28,7 +27,6 @@
 #include <string>
 #include <vector>
 #include "Problem.hpp"
-#include "Algorithms.hpp"
 
 
 class Problem36 : public Problem{
@@ -47,11 +45,12 @@ 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 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
+	virtual std::string getResult() const;	//Returns a string with the solution to the problem
+	std::vector<int> getPalindromes() const;	//Return the vector of palindromes < MAX_NUM
+	int getSumOfPalindromes() const;	//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