Updated all problems to use fstrings and results()

Problems/Problem4.py

@@ -1,7 +1,7 @@
 #ProjectEuler/Python/Problem4.py
 #Matthew Ellison
 # Created: 01-28-19
-#Modified: 10-29-20
+#Modified: 10-30-20
 #Find the largest palindrome made from the product of two 3-digit numbers
 #Unless otherwise listed, all of my non-standard imports can be gotten from my pyClasses repository at https://bitbucket.org/Mattrixwv/pyClasses
 """
@@ -66,17 +66,19 @@ class Problem4(Problem):
 
 		#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.palindromes.clear()
+
+	#Gets
 	#Returns the result of solving the problem
 	def getResult(self):
 		#If the problem hasn't been solved throw an exception
 		if(not self.solved):
 			raise Unsolved("You must solve the problem before you can see the result")
-		return "The largest palindrome made from the product of two 3-digit numbers is " + str(self.palindromes[len(self.palindromes) - 1])
-	#Gets
+		return f"The largest palindrome made from the product of two 3-digit numbers is {self.palindromes[len(self.palindromes) - 1]}"
 	#Returns the list of all palindromes
 	def getPalindromes(self) -> list:
 		#If the problem hasn't been solved throw an exceptions
@@ -91,15 +93,6 @@ class Problem4(Problem):
 		return self.palindromes[len(self.palindromes) - 1]
 
 
-#If you are running this file, automatically start the correct function
-if __name__ == '__main__':
-	problem = Problem4()
-	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 largest palindrome made from the product of two 3-digit numbers is 906609
 It took an average of 149.187 milliseconds to run this problem through 100 iterations