Updated to work with the new libraries

headers/Problems/Problem8.hpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem8.hpp
 //Matthew Ellison
 // Created: 09-28-18
-//Modified: 08-28-20
+//Modified: 07-02-21
 //Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
 /*
 73167176531330624919225119674426574742355349194934
@@ -27,7 +27,7 @@
 */
 //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
@@ -42,14 +42,12 @@
 	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 PROBLEM8_HPP
 #define PROBLEM8_HPP
 
 
 #include <cinttypes>
 #include <string>
-#include <vector>
 #include "Problem.hpp"
 
 
@@ -68,16 +66,17 @@ 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::string getLargestNums() const;		//Returns the string of numbers that produces the largest product
 	uint64_t getLargestProduct() const;		//Returns the requested product
 };
 
 
-/* Results
+/* Results:
 The greatest product is 23514624000
 The numbers are 5576689664895
 It took an average of 129.024 microseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM8_HPP
+
+#endif	//PROBLEM8_HPP