Updated comments and made sure style was consistent

Source/Problem25.cpp

@@ -1,14 +1,14 @@
-//ProjectEuler/C++/Source/Problem25.cpp
+//ProjectEuler/ProjectEulerCPP/Source/Problem25.cpp
 //Matthew Ellison
 // Created: 11-13-18
-//Modified: 07-14-19
+//Modified: 07-09-20
 //What is the index of the first term in the Fibonacci sequence to contain 1000 digits?
 //Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myClasses
 //This file contains a header from the gmp library. The library is used for large integers.
 //You can find more information about them at https://gmplib.org/
 //When compiling this file you need to have the gmp library installed as well as linking the libraries to your executable using the -lgmpxx and -lgmp flags
 /*
-	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,13 +33,16 @@
 #include "../Headers/Problem25.hpp"
 
 
+//The number of digits to calculate up to
 unsigned int Problem25::NUM_DIGITS = 1000;	//The number of digits to calculate up to
 
+//Constructor
 Problem25::Problem25() : Problem("What is the index of the first term in the Fibonacci sequence to contain 1000 digits?"), number(0), index(2){
 	number = 0;
 	index = 0;
 }
 
+//Solve the problem
 void Problem25::solve(){
 	//If the problem has already been solved do nothing and end the function
 	if(solved){
@@ -62,6 +65,14 @@ void Problem25::solve(){
 	solved = true;
 }
 
+//Reset the problem so it can be run again
+void Problem25::reset(){
+	Problem::reset();
+	number = 0;
+	index = 2;
+}
+
+//Return a string with the solution to the problem
 std::string Problem25::getString() const{
 	//If the problem hasn't been solved throw an exception
 	if(!solved){
@@ -118,9 +129,3 @@ uint64_t Problem25::getIndexInt() const{
 	}
 	return index.get_ui();
 }
-
-void Problem25::reset(){
-	Problem::reset();
-	number = 0;
-	index = 2;
-}