Updated to work with the new libraries

headers/Problems/Problem19.hpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem19.hpp
 //Matthew Ellison
 // Created: 09-28-18
-//Modified: 08-28-20
+//Modified: 07-02-21
 //How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
 /*
 You are given the following information, but you may prefer to do some research for yourself.
@@ -16,7 +16,7 @@ A leap year occurs on any year evenly divisible by 4, but not on a century unles
 */
 //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
@@ -31,7 +31,6 @@ A leap year occurs on any year evenly divisible by 4, but not on a century unles
 	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 PROBLEM19_HPP
 #define PROBLEM19_HPP
 
@@ -62,12 +61,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
-	uint64_t getTotalSundays() const;		//Returns the total sundays that were asked for
+	virtual std::string getResult() const;	//Return a string with the solution to the problem
+	uint64_t getTotalSundays() const;	//Returns the total sundays that were asked for
 };
+
+
 /* Results
 There are 171 Sundays that landed on the first of the months from 1901 to 2000
 It took an average of 1.400 milliseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM19_HPP
+
+#endif	//PROBLEM19_HPP