mirror of
https://bitbucket.org/Mattrixwv/projecteulerpython.git
synced 2025-12-06 17:43:58 -05:00
Added solution for problem 35
This commit is contained in:
@@ -35,12 +35,14 @@ class Problem34(Problem):
|
||||
#Functions
|
||||
#Constructor
|
||||
def __init__(self):
|
||||
super().__init__("")
|
||||
super().__init__("Find the sum of all numbers which are equal to the sum of the factorial of their digits")
|
||||
self.totalSum = 0
|
||||
self.factorials = []
|
||||
for cnt in range(0, 10):
|
||||
for _ in range(0, 10):
|
||||
self.factorials.append(0)
|
||||
|
||||
#Operational functions
|
||||
#Solve the problem
|
||||
def solve(self):
|
||||
#If the problem has already been solved do nothing and end the function
|
||||
if(self.solved):
|
||||
|
||||
Reference in New Issue
Block a user