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

Updated run times and a few typos

Browse Source
This commit is contained in:
Mattrixwv
2020-07-21 09:54:55 -04:00
parent db0788d2cc
commit 467e15817d
33 changed files with 47 additions and 42 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
Problems/Problem27.py
View File

@@ -83,7 +83,7 @@ class Problem27(Problem):
super().reset()
self.topA = 0
self.topB = 0
self.topB = 0
self.topN = 0
self.primes.clear()
#Gets
@@ -120,5 +120,5 @@ if __name__ == "__main__":
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
It took an average of 49.963 seconds to run this problem through 100 iterations
"""