Added solution to problem 38

ProblemSelection.py

@@ -1,10 +1,10 @@
 #ProjectEulerPython/ProblemSelection.py
 #Matthew Ellison
 # Created: 07-19-20
-#Modified: 07-19-20
+#Modified: 10-20-21
 #This is the driver function for the Java version of the ProjectEuler project
 """
-Copyright (C) 2020  Matthew Ellison
+Copyright (C) 2021  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
@@ -59,6 +59,7 @@ from Problems.Problem34 import Problem34
 from Problems.Problem35 import Problem35
 from Problems.Problem36 import Problem36
 from Problems.Problem37 import Problem37
+from Problems.Problem38 import Problem38
 from Problems.Problem67 import Problem67
 
 
@@ -67,7 +68,7 @@ class ProblemSelection:
 	problemNumbers = [ 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10,
 						  11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
 						  21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
-						  31, 32, 33, 34, 35, 36, 37, 67]
+						  31, 32, 33, 34, 35, 36, 37, 38, 67]
 
 	#Returns the problem corresponding to the given problem number
 	@staticmethod
@@ -146,6 +147,8 @@ class ProblemSelection:
 			return Problem36()
 		elif(problemNumber == 37):
 			return Problem37()
+		elif(problemNumber == 38):
+			return Problem38()
 		elif(problemNumber == 67):
 			return Problem67()