Added results to 38

headers/Problems/Problem38.hpp

@@ -33,8 +33,8 @@ private:
 	//Static variables
 	static int HIGHEST_POSSIBLE_NUM;	//The highest number that needs to be checked for a 1-9 pandigital
 	//Instance variables
-	uint64_t largestNum;
-	uint64_t pandigital;
+	uint64_t largestNum;	//The number passed to the executeFormula function that returns the largest pandigital
+	uint64_t pandigital;	//The largest pandigital number found
 	//Functions
 	std::string executeFormula(int num);	//Take the number and add its multiples to a string to return
 public:
@@ -49,3 +49,8 @@ public:
 	uint64_t getLargestNum() const;	//Returns the largest number
 	uint64_t getPandigital() const;	//Returns the pandigital of the number
 };
+
+/* Results:
+The largest appended product pandigital is 932718654
+It took 740.729 microseconds to solve this problem.
+*/