Updated to work with the new libraries

headers/Problems/Problem12.hpp

@@ -1,10 +1,11 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem12.hpp
 //Matthew Ellison
 // Created: 09-27-18
-//Modified: 08-28-20
+//Modified: 07-02-21
 //What is the value of the first triangle number to have over five hundred divisors?
 //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
@@ -19,14 +20,13 @@
 	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 PROBLEM12_HPP
 #define PROBLEM12_HPP
 
 
-#include <vector>
 #include <cinttypes>
 #include <string>
+#include <vector>
 #include "Problem.hpp"
 
 
@@ -46,7 +46,7 @@ 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
 	int64_t getTriangularNumber() const;	//Returns the triangular number
 	int64_t getLastNumberAdded() const;		//Get the final number that was added to the triangular number
 	std::vector<int64_t> getDivisorsOfTriangularNumber() const;	//Returns the list of divisors of the requested number
@@ -59,4 +59,5 @@ The triangular number 76576500 is a sum of all numbers >= 12375 and has 576 divi
 It took an average of 280.536 milliseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM12_HPP
+
+#endif	//PROBLEM12_HPP