Updated to work with the new libraries

headers/Problems/Problem24.hpp

@@ -1,11 +1,11 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem24.hpp
 //Matthew Ellison
 // Created: 11-11-18
-//Modified: 08-28-20
+//Modified: 07-02-21
 //What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
 //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,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 PROBLEM24_HPP
 #define PROBLEM24_HPP
 
@@ -44,14 +43,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
+	virtual std::string getResult() const;	//Return a string with the solution to the problem
 	std::vector<std::string> getPermutationsList() const;	//Returns a vector with all of the permutations
 	std::string getPermutation() const;		//Returns the specific permutations you are looking for
 };
 
+
 /* Results
 The 1 millionth permutation is 2783915460
 It took an average of 1.157 seconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM24_HPP
+
+#endif	//PROBLEM24_HPP