Updated to work with the new libraries

headers/Problems/Problem11.hpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem11.hpp
 //Matthew Ellison
 // Created: 09-29-18
-//Modified: 08-28-20
+//Modified: 07-02-21
 //What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid?
 /*
 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
@@ -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,7 +42,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 PROBLEM11_HPP
 #define PROBLEM11_HPP
 
@@ -66,15 +65,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::vector<int> getNumbers() const;	//Returns the numbers that were being searched
 	int getProduct() const;		//Returns the product that was requested
 };
 
+
 /* Results:
 The greatest product of 4 number in a line is 70600674
 The numbers are 89 94 97 87
 It took an average of 11.201 microseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM11_HPP
+
+#endif	//PROBLEM11_HPP