diff options
| author | mjfernez <mjfernez@gmail.com> | 2020-02-03 19:49:58 -0500 |
|---|---|---|
| committer | mjfernez <mjfernez@gmail.com> | 2020-02-03 19:49:58 -0500 |
| commit | e6a7399134b3dc08f9e6e9c9c74e39ac449b8538 (patch) | |
| tree | 2cd7b6ba1a10562d219028aa84aedfc49d872761 /collatz.py | |
| parent | d62ba829dc3a54edc46b7deb581dd244713393f5 (diff) | |
| download | Project_Euler_Solutions-e6a7399134b3dc08f9e6e9c9c74e39ac449b8538.tar.gz | |
Fix dumb mistakes
Diffstat (limited to 'collatz.py')
| -rw-r--r-- | collatz.py | 5 |
1 files changed, 2 insertions, 3 deletions
@@ -1,5 +1,4 @@ import PIL, math -import numpy as np #Problem 14 Longest Collatz sequence #Note, a little slow, takes about 15 seconds. @@ -21,5 +20,5 @@ for n in range(1,pow(10,6)): if(len(chain)>len(biggo)): biggo = chain chain = [] -print biggo -print "Has " + str(len(biggo)) +" numbers." +print(biggo) +print("Has " + str(len(biggo)) +" numbers.") |