Updated to work with the new libraries

headers/Problems/Problem26.hpp

@@ -1,11 +1,11 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem26.hpp
 //Matthew Ellison
 // Created: 07-28-19
-//Modified: 08-28-20
+//Modified: 07-02-21
 //Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.
 //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,8 +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 PROBLEM26_HPP
 #define PROBLEM26_HPP
 
@@ -45,7 +43,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
 	unsigned int getLongestCycle() const;	//Returns the length of the longest cycle
 	unsigned int getLongestNumber() const;	//Returns the denominator that starts the longest cycle
 };
@@ -57,4 +55,5 @@ It is started with the number 983
 It took an average of 9.989 milliseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM26_HPP
+
+#endif	//PROBLEM26_HPP