euler/problem008.py at master · kju2/euler · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
"""
Find the greatest product of five consecutive digits in the 1000-digit number.
"""

NUM = """7316717653133062491922511967442657474235534919493496983520312774506326
    239578318016984801869478851843858615607891129494954595017379583319528532088
    055111254069874715852386305071569329096329522744304355766896648950445244523
    161731856403098711121722383113622298934233803081353362766142828064444866452
    387493035890729629049156044077239071381051585930796086670172427121883998797
    908792274921901699720888093776657273330010533678812202354218097512545405947
    522435258490771167055601360483958644670632441572215539753697817977846174064
    955149290862569321978468622482839722413756570560574902614079729686524145351
    004748216637048440319989000889524345065854122758866688116427171479924442928
    230863465674813919123162824586178664583591245665294765456828489128831426076
    900422421902267105562632111110937054421750694165896040807198403850962455444
    362981230987879927244284909188845801561660979191338754992005240636899125607
    176060588611646710940507754100225698315520005593572972571636269561882670428
    252483600823257530420752963450"""

NUM = [int(d) for d in NUM if d.isdigit()]


def main():
    """
    >>> main()
    40824
    """
    max_product = 0

    for i in range(len(NUM) - 4):
        product = NUM[i] * NUM[i + 1] * NUM[i + 2] * NUM[i + 3] * NUM[i + 4]

        max_product = max(product, max_product)

    print(max_product)


if __name__ == "__main__":
    import doctest
    doctest.testmod()