mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 13:31:07 +00:00
9417091dab
small off by one error. Boundary condition: if len(number) =13 , we would need to check exactly 1 combination, namely number itself. However for i in range(len(number)-13): will iterate 0 times.
16 lines
348 B
Python
16 lines
348 B
Python
import sys
|
|
def main():
|
|
LargestProduct = -sys.maxsize-1
|
|
number=input().strip()
|
|
for i in range(len(number)-12):
|
|
product=1
|
|
for j in range(13):
|
|
product *= int(number[i+j])
|
|
if product > LargestProduct:
|
|
LargestProduct = product
|
|
print(LargestProduct)
|
|
|
|
|
|
if __name__ == '__main__':
|
|
main()
|