Updated to work with the new libraries

headers/Problems/Problem15.hpp

@@ -1,11 +1,11 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem15.hpp
 //Matthew Ellison
 // Created: 09-29-18
-//Modified: 08-28-20
+//Modified: 07-02-21
 //How many routes from the top left corner to the bottom right corner are there through a 20×20 grid if you can only move right and down?
 //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
@@ -50,12 +50,15 @@ 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
 	uint64_t getNumberOfRoutes() const;		//Returns the number of routes found
 };
+
+
 /* Results:
 The number of routes is 137846528820
 It took an average of 18.010 minutes to run this problem through 10 iterations
 */
 
-#endif //PROBLEM15_HPP
+
+#endif	//PROBLEM15_HPP