Python/project_euler/problem_08/sol2.py

9 lines
210 B
Python
Raw Normal View History

from functools import reduce
def main():
number=input().strip()
print(max([reduce(lambda x,y: int(x)*int(y),number[i:i+13]) for i in range(len(number)-12)]))
if __name__ == '__main__':
main()