Updated to work with the new libraries

headers/Problems/Problem4.hpp

@@ -1,11 +1,11 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem4.hpp
 //Matthew Ellison
 // Created: 09-28-18
-//Modified: 08-28-20
+//Modified: 07-02-21
 //Find the largest palindrome made from the product of two 3-digit numbers
 //Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
 /*
-	Copyright (C) 2020  Matthew Ellison
+	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
@@ -20,13 +20,13 @@
 	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 PROBLEM4_HPP
 #define PROBLEM4_HPP
 
 
-#include <vector>
+#include <cinttypes>
 #include <string>
+#include <vector>
 #include "Problem.hpp"
 
 
@@ -45,7 +45,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();	//Return a string with the solution to the problem
+	virtual std::string getResult() const;	//Return a string with the solution to the problem
 	std::vector<uint64_t> getPalindromes() const;	//Returns the list of all palindromes
 	uint64_t getLargestPalindrome() const;	//Returns the largest palindrome
 };
@@ -56,4 +56,5 @@ The largest palindrome is 906609
 It took an average of 36.525 milliseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM4_HPP
+
+#endif	//PROBLEM4_HPP