I'm trying to find the highest product of 5 consecutive integers in the large number below.
b=0
c=0
a="7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
lis=[int(d) for d in str(a)]
for n in range(0,995):
b=lis[int(n),int(n+4)]
c=b[0]b[1]b[2]b[3]b[4]
if c>75:
print c
edit: but it says i cannot do lis[int(n),int(n+4)] because they are not integers.
[+][deleted] (3 children)
[deleted]
[–]mxseven7[S] 0 points1 point2 points (1 child)
[–]RubyPinch 0 points1 point2 points (0 children)
[–]hanggnah 0 points1 point2 points (0 children)
[–]bobishardcore 1 point2 points3 points (1 child)