Updated to work with the new libraries

headers/Problems/Problem34.hpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem34.hpp
 //Matthew Ellison
 // Created: 06-01-21
-//Modified: 06-01-21
+//Modified: 07-02-21
 //Find the sum of all numbers which are equal to the sum of the factorial of their digits
 //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 PROBLEM34_HPP
 #define PROBLEM34_HPP
 
@@ -45,14 +44,16 @@ 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
-	std::vector<int> getFactorials();	//Returns the list of factorials from 0-9
-	int getSum();	//Returns the sum of all numbers equal to the sum of their digit's factorials
+	virtual std::string getResult() const;	//Return a string with the solution to the problem
+	std::vector<int> getFactorials() const;	//Returns the list of factorials from 0-9
+	int getSum() const;	//Returns the sum of all numbers equal to the sum of their digit's factorials
 };
 
+
 /* Results:
 The sum of all numbers that are the sum of their digit's factorials is 40730
 It took an average of 15.181 milliseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM34_HPP
+
+#endif	//PROBLEM34_HPP