ProjectEuler/ProjectEulerPython
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulerpython.git synced 2025-12-06 17:43:58 -05:00
Code Issues Packages Projects Releases Wiki Activity

Added solution to problem 36

Browse Source
This commit is contained in:
Mattrixwv
2021-06-29 15:37:23 -04:00
parent 38803dd7f1
commit 16ceb98e31
3 changed files with 105 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Problems/Problem35.py
View File

@@ -51,7 +51,7 @@ class Problem35(Problem):
#Operational functions
#Solve the problem
def solve(self):
#If the porblem has already been solved do nothing and end the function
#If the problem has already been solved do nothing and end the function
if(self.solved):
return
@@ -91,7 +91,7 @@ class Problem35(Problem):
def getResult(self) -> str:
#If the problem hasn't been solved throw an exception
if(not self.solved):
raise Unsolved("You must solve the porblem before you can see the result")
raise Unsolved("You must solve the problem before you can see the result")
return f"The number of all circular prime numbers under {self.__max_num} is {len(self.circularPrimes)}"
#Returns the list of primes < max_num
def getPrimes(self) -> list: