Home > Problem, Projects/Experiments, Python > Python: Largest product in series

## Python: Largest product in series

Python: Largest product in a series
Problem 8 @ projectEuler

In Problem 8, ProjectEuler wants to find the thirteen adjacent digits in the 1000-digit number that have the greatest product.

In this task i use a for loop to check each 13-dig set, each time creating a set of 13 digits starting from (0,13) then (1,14)..(2,15)….. and so-on. for each set i get the product of its digits and store it in an a array of [set,total] each time if total of the new set is larger than what we have in the array[total] then we write the new values to the array, we call the array largest.

The Code:

# Largest product in a series
# ProjectEuler: Problem 8
num=’7316717653133062491922511967442657474235534919493496983520312774506326239578318016984
8018694788518438586156078911294949545950173795833195285320880551112540698747158523863050715
6932909632952274430435576689664895044524452316173185640309871112172238311362229893423380308
13533627661428280644448664523874930358907296290491560440772390713810515859307960866701724271
218839987979087922749219016997208880937766572733300105336788122023542180975125454059475224
3525849077116705560136048395864467063244157221553975369781797784617406495514929086256932197
8468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345
0658541227588666881164271714799244429282308634656748139191231628245861786645835912456652947
6545682848912883142607690042242190226710556263211111093705442175069416589604080719840385096
2455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588
6116467109405077541002256983155200055935729725716362695618826704282524836008232575304207529
63450

v1=0
v2=13
set1=num[v1:v2]
largest =[0,0]
tot=1

for x in range((1000)):

set1=num[v1:v2]

for each in set1:

tot=tot * int(each)

if tot > largest [1]:

largest[0] = set1

largest[1] = tot

tot=1

tot =1

v1=v1+1

v2=v2+1

print’The thirteen adjacent digits are’,largest[1],’there product is ‘,largest[0]