Changed problems to work with a driver function

Problems/Problem9.py

@@ -0,0 +1,128 @@
+#Project Euler/Python/Problem9.py
+#Matthew Ellison
+# Created: 01-29-19
+#Modified: 07-18-20
+#There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc.
+#Unless otherwise listed, all of my non-standard imports can be gotten from my pyClasses repository at https://bitbucket.org/Mattrixwv/pyClasses
+"""
+	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
+	the Free Software Foundation, either version 3 of the License, or
+	(at your option) any later version.
+
+	This program is distributed in the hope that it will be useful,
+	but WITHOUT ANY WARRANTY; without even the implied warranty of
+	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+	GNU Lesser General Public License for more details.
+
+	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/>.
+"""
+
+
+from Problems.Problem import Problem
+from Stopwatch import Stopwatch
+from Unsolved import Unsolved
+import math
+
+
+class Problem9(Problem):
+	#Functions
+	#Constructor
+	def __init__(self):
+		super().__init__("There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc.")
+		self.a = 1
+		self.b = 0
+		self.c = 0
+		self.found = False
+
+	#Operational functions
+	#Solve the problem
+	def solve(self):
+		#If the problem has already been solved do nothing and end the function
+		if(self.solved):
+			return
+
+		#Start the timer
+		self.timer.start()
+
+		#Start with the lowest possible a , 1, and search for the b and c to complete the triplet
+		while((self.a <= (1000 / 3)) and (not self.found)):
+			#Setup b and c
+			self.b = self.a + 1	#b must be > a to be a triplet
+			self.c = math.hypot(self.a, self.b)	#C is the hyp
+			#Loop through possible b's and calculate c's until you find the numbers or the sum gets too large
+			while((self.a + self.b + self.c) < 1000):
+				self.b += 1
+				self.c = math.hypot(self.a, self.b)
+				#If c is an integer make it one
+				if((self.c % 1) == 0):
+					self.c = int(round(self.c))
+			#Check if the correct sides were found
+			if((self.a + self.b + self.c) == 1000):
+				self.found = True
+			#Otherwise increment a to the next possible number
+			else:
+				self.a += 1
+
+		#Stop the timer
+		self.timer.stop()
+
+		#Save the results
+		if(self.found):
+			self.result = "The Pythagorean triplet where a + b + c = 1000 is " + str(self.a) + " " + str(self.b) + " " + str(int(self.c)) + "\nThe product of those numbers is " + str(int(self.a * self.b * self.c))
+		else:
+			self.result = "Could not find the triplet where a + b + c = 1000"
+
+		#Throw a flag to show the problem is solved
+		self.solved = True
+	#Reset the problem so it can be run again
+	def reset(self):
+		super().reset()
+		self.a = 1
+		self.b = 0
+		self.c = 0
+		found = False
+
+	#Gets
+	#Returns the length of the first side
+	def getSideA(self) -> int:
+		#If the problem hasn't been solved throw an exception
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before you can get the length of the first side")
+		return self.a
+	#Returns the length of the second side
+	def getSideB(self) -> int:
+		#If the problem hasn't been solved throw an exception
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before you can get the length of the second side")
+		return self.b
+	#Returns the length of the hyp
+	def getSideC(self) -> float:
+		#If the problem hasn't been solved throw an exception
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before you can get the length of the hyp")
+		return self.c
+	#Returns the product of the 3 sides
+	def getProduct(self) -> int:
+		#If the problem hasn't been solved throw an exception
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before you can get the length first side")
+		return int(self.a * self.b * self.c)
+
+#If you are running this file, automatically start the correct function
+if __name__ == "__main__":
+	problem = Problem9()
+	print(problem.getDescription())	#Print the description of the problem
+	problem.solve()	#Solve the problem
+	#Print the results
+	print(problem.getResult())
+	print("It took " + problem.getTime() + " to solve this algorithm")
+
+"""Results:
+The Pythagorean triplet where a + b + c = 1000 is 200 375 425
+The product of those numbers is 31875000
+It took 22.106 milliseconds to run this algorithm
+"""