Updated comments and made sure style was consistent

Headers/Problem1.hpp

@@ -1,11 +1,11 @@
-//ProjectEuler/C++/Headers/Problem1.hpp
+//ProjectEuler/ProjectEulerCPP/Headers/Problem1.hpp
 //Matthew Ellison
 // Created: 09-28-18
-//Modified: 07-14-19
+//Modified: 07-09-20
 //What is the sum of all the multiples of 3 or 5 that are less than 1000
 //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
@@ -33,21 +33,26 @@
 
 class Problem1: public Problem{
 private:
-	static uint64_t MAX_NUMBER;
+	//Variables
+	//Static variables
+	static uint64_t MAX_NUMBER;	//The highest number to be tested
+	//Instance variables
 	uint64_t fullSum;		//For the sum of all the numbers
 	std::vector<uint64_t> numbers;	//Holds all the numbers
 public:
+	//Constructor
 	Problem1();
-	virtual void solve();
-	virtual std::string getString() const;
-	virtual void reset();
-	//Returns the requested sum
-	uint64_t getSum() 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
+	uint64_t getSum() const;	//Returns the requested sum
 };
 
 /* Results:
 The sum of all the numbers < 1000 that are divisible by 3 or 5 is 233168
-It took 4.500 microseconds to solve this problem.
+It took an average of 957.000 nanoseconds to run this problem over 100 iterations
 */
 
 #endif //PROBLEM1_HPP