Changed problems to work with a driver function

Problems/Problem27.py

@@ -0,0 +1,124 @@
+#ProjectEuler/Python/Problem27.py
+#Matthew Ellison
+# Created: 09-15-19
+#Modified: 07-19-20
+#Find the product of the coefficients, |a| < 1000 and |b| <= 1000, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n=0.
+#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 Algorithms
+
+
+class Problem27(Problem):
+	#Functions
+	#Constructor
+	def __init__(self):
+		super().__init__("Find the product of the coefficients, |a| < 1000 and |b| <= 1000, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n=0")
+		self.topA = 0	#The A for the most n's generated
+		self.topB = 0	#The B for the most n's generated
+		self.topN = 0	#The most n's generated
+		self.primes = []	#A list of all primes that could possibly be generated with this formula
+
+	#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()
+
+		#Get the primes
+		primes = Algorithms.getPrimes(12000)	#A list of all primes that could possibly be generated with this formula
+		#Start with the lowest possible A and check all possibilities after that
+		for a in range(-999, 999):
+			#Start with the lowest possible B and check all possibilities after that
+			for b in range(-1000, 1000):
+				#Start with n=0 and check the formula to see how many primes you can get get with concecutive n's
+				n = 0
+				quadratic = (n * n) + (a * n) + b
+				while(quadratic in primes):
+					n += 1
+					quadratic = (n * n) + (a * n) + b
+				n -= 1  #Negate an n because the last formula failed
+
+				#Set all the largest numbers if this created more primes than any other
+				if(n > self.topN):
+					self.topN = n
+					self.topB = b
+					self.topA = a
+
+		#Stop the timer
+		self.timer.stop()
+
+		#Save the results
+		self.result = "The greatest number of primes found is " + str(self.topN)
+		self.result += "\nIt was found with A = " + str(self.topA) + ", B = " + str(self.topB)
+		self.result += "\nThe product of A and B is " + str(self.topA * self.topB)
+
+		#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.topA = 0
+		self.topB = 0
+		self.topB = 0
+		self.primes.clear()
+
+	#Gets
+	#Returns the top A that was generated
+	def getTopA(self) -> int:
+		#If the problem hasn't been solved throw an exception
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before can you see the top A")
+		return self.topA
+	#Returns the top B that was generated
+	def getTopB(self) -> int:
+		#If the problem hasn't been solved throw an exception
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before can you see the top B")
+		return self.topA
+	#Returns the top N that was generated
+	def getTopN(self) -> int:
+		#If the problem hasn't been solved throw an exception
+		if(not self.solved):
+			raise Unsolved("You must solve the problem before can you see the top N")
+		return self.topA
+
+
+#This calls the appropriate functions if the script is called stand alone
+if __name__ == "__main__":
+	problem = Problem27()
+	print(problem.getDescription())	#Print the description
+	problem.solve()		#Call the function that answers the problem
+	#Print the results
+	print(problem.getResult())
+	print("It took " + problem.getTime() + " to solve this algorithm")
+
+""" Results:
+The greatest number of primes found is 70
+It was found with A = -61, B = 971
+The product of A and B is -59231
+It took 35.775 seconds to run this algorithm
+"""