Updated comments and made sure style was consistent

Headers/Problem12.hpp

@@ -1,10 +1,10 @@
-//ProjectEuler/C++/Headers/Problem12.hpp
+//ProjectEuler/ProjectEulerCPP/Headers/Problem12.hpp
 //Matthew Ellison
 // Created: 09-27-18
-//Modified: 07-14-19
+//Modified: 07-09-20
 //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) 2019  Matthew Ellison
+/*	Copyright (C) 2020  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
@@ -32,29 +32,31 @@
 
 class Problem12 : public Problem{
 private:
+	//Variables
+	//Static variables
 	static uint64_t GOAL_DIVISORS;	//The number of divisors that you want
+	//Instance variables
 	int64_t sum;			//The sum of the numbers up to counter
 	int64_t counter;		//The next number to be added to sum
 	std::vector<int64_t> divisors;	//Holds the divisors of the triangular number sum
 public:
+	//Constructor
 	Problem12();
-	virtual void solve();
-	virtual std::string getString() const;
-	virtual void reset();
-	//Returns the triangular number
-	int64_t getTriangularNumber() const;
-	//Get the final number that was added to the triangular number
-	int64_t getLastNumberAdded() const;
-	//Returns the list of divisors of the requested number
-	std::vector<int64_t> getDivisorsOfTriangularNumber() const;
-	//Returns the number of divisors of the requested number
-	size_t getNumberOfDivisors() const;
+	//Operational functions
+	virtual void solve();	//Solve the problem
+	virtual void reset();	//Reset the problem so it can be run again
+	//Gets
+	virtual std::string getString() 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
+	size_t getNumberOfDivisors() const;		//Returns the number of divisors of the requested number
 };
 
 
 /* Results:
 The triangular number 76576500 is a sum of all numbers >= 12375 and has 576 divisors
-It took 262.765 milliseconds to solve this problem.
+It took an average of 280.536 milliseconds to run this problem over 100 iterations
 */
 
 #endif //PROBLEM12_HPP