Updated to work with the new libraries

headers/Problems/Problem14.hpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem14.hpp
 //Matthew Ellison
 // Created: 09-29-18
-//Modified: 08-28-20
+//Modified: 07-02-21
 /*
 The following iterative sequence is defined for the set of positive integers:
 n → n/2 (n is even)
@@ -10,7 +10,7 @@ Which starting number, under one million, produces the longest chain?
 */
 //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
@@ -25,7 +25,6 @@ Which starting number, under one million, produces the longest chain?
 	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 PROBLEM14_HPP
 #define PROBLEM14_HPP
 
@@ -53,14 +52,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
-	uint64_t getLength() const;	//Returns the length of the requested chain
+	virtual std::string getResult() const;	//Return a string with the solution to the problem
+	uint64_t getLength() const;		//Returns the length of the requested chain
 	uint64_t getStartingNumber() const;	//Returns the starting number of the requested chain
 };
 
+
 /* Results:
 The number 837799 produced a chain of 525 steps
 It took an average of 197.008 milliseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM14_HPP
+
+#endif	//PROBLEM14_HPP