Updated to work with the new libraries

headers/Problems/Problem67.hpp

@@ -1,7 +1,7 @@
 //ProjectEuler/ProjectEulerCPP/headers/Problems/Problem67.hpp
 //Matthew Ellison
 // Created: 11-02-18
-//Modified: 07-09-20
+//Modified: 07-02-21
 //The way to do this is using a breadth first search
 /*
 Find the maximum total from top to bottom
@@ -108,7 +108,7 @@ Find the maximum total from top to bottom
 */
 //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
@@ -123,11 +123,11 @@ Find the maximum total from top to bottom
 	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 PROBLEM67_HPP
 #define PROBLEM67_HPP
 
 
+#include "Problem67.hpp"
 #include "Problem18.hpp"
 
 
@@ -136,15 +136,14 @@ class Problem67 : public Problem18{
 private:
 	void setupList();
 public:
-	Problem67() : Problem18(){
-		list.clear();
-		setupList();
-	}
+	Problem67();
 };
 
+
 /* Results:
 The value of the longest path is 7273
 It took an average of 366.373 milliseconds to run this problem over 100 iterations
 */
 
-#endif //PROBLEM67_HPP
+
+#endif	//PROBLEM67_HPP