Reputation: 2921
I have this code, which splits a number into groups of 5, puts them into a list, and then multiples them. This is Problem 8 in Project Euler, if you're confused. It's also not finished, as I need to find the other possible 5 consecutive integers.
def split_number(number, n):
line = str(number)
split = [line[i:i+n] for i in range(0, len(line), n)]
return split
splitnum = split_number((extremely long number), 5)
for x in enumerate(splitnum[:-1]):
split5 = split_number(splitnum[x], 1)
for n in split5:
splitproduct = reduce(lambda x, y: x*y, splitnum[n])
if (splitproduct > solution):
solution = splitproduct
print solution
When I try to run this, I get the error
TypeError: list indices must be integers, not tuple
I guess when I iterate through splitnum, x is a tuple. I need it to be an integer so I can use split5() correctly.
New code:
def split_number(number, n):
line = str(number)
split = [line[i:i+n] for i in range(1, len(line)-n+1, n)]
return split
number =
while len(split_number(number,1)) is not 0:
splitnum = split_number((number), 5)
solution = 0
for x in splitnum[:-1]:
split5 = split_number(x, 1)
for n in split5:
splitproduct = reduce(lambda x, y: x*y, n)
if (splitproduct > solution):
solution = splitproduct
number = split_number(number, 1)
del number[0]
print solution
Now I'm getting a memory error on the 'split' line in function split_number. that's probably because of the extremely long number. But that isn't the topics question, I just wanted you guys to see how I implemented their solutions (which worked, because the program actually runs). :)
Upvotes: 1
Views: 175
Reputation: 298166
All you need to do is multiply together all 5-long substrings of your string and see which one is the biggest:
import operator
n = map(int, '7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450')
print max(reduce(operator.mul, n[i:i + 5]) for i in range(len(n) - 5))
Upvotes: 2