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

5
Problems/Problem15.py
View File

@@ -4,8 +4,6 @@
#Modified: 07-18-20
#How many routes from the top left corner to the bottom right corner are there through a 20×20 grid if you can only move right and down?
#Unless otherwise listed, all of my non-standard imports can be gotten from my pyClasses repository at https://bitbucket.org/Mattrixwv/pyClasses
#There must be a better way than this. This is untested. I let it run for about 14 hours and it still hadn't spit an answer out for me
#But it is programed exactly as I programmed the C++ solution, so the eventual answer should be correct
"""
Copyright (C) 2020 Matthew Ellison
@@ -101,5 +99,6 @@ if __name__ == "__main__":
print("It took " + problem.getTime() + " to solve this algorithm")
"""Results:
The number of paths from 1 corner of a 20 x 20 grid to the opposite corner is 137846528820
It took 32.903 hours to solve this algorithm
"""