'''
### Problem 0008 ### Largest product in a series ###
Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
'''

thousand_digits = [
    '73167176531330624919225119674426574742355349194934',
    '96983520312774506326239578318016984801869478851843',
    '85861560789112949495459501737958331952853208805511',
    '12540698747158523863050715693290963295227443043557',
    '66896648950445244523161731856403098711121722383113',
    '62229893423380308135336276614282806444486645238749',
    '30358907296290491560440772390713810515859307960866',
    '70172427121883998797908792274921901699720888093776',
    '65727333001053367881220235421809751254540594752243',
    '52584907711670556013604839586446706324415722155397',
    '53697817977846174064955149290862569321978468622482',
    '83972241375657056057490261407972968652414535100474',
    '82166370484403199890008895243450658541227588666881',
    '16427171479924442928230863465674813919123162824586',
    '17866458359124566529476545682848912883142607690042',
    '24219022671055626321111109370544217506941658960408',
    '07198403850962455444362981230987879927244284909188',
    '84580156166097919133875499200524063689912560717606',
    '05886116467109405077541002256983155200055935729725',
    '71636269561882670428252483600823257530420752963450'
    ]

def assembly_number():
    number = ''
    for row in thousand_digits:
        number += str(row)
    return number

def solve_0008(num_adj_digits):
    num = assembly_number()
    max_product = 1
    num_with_max_product = ''

    for position in range(len(num)-num_adj_digits):
        product = 1
        for position_in_sequence in range(position, position + num_adj_digits):
            product *= int(num[position_in_sequence])
    if product > max_product:
            max_product = product
            num_with_max_product = num[position:position + num_adj_digits]
    print('{0} adjacent digits {1} have the greatest product of {2}'.format(num_adj_digits, num_with_max_product, max_product))

solve_0008(4)
solve_0008(13)

f2d6944c10170cef06e36dafea391005a54908ff
<mask token>


def solve_0008(num_adj_digits):
    num = assembly_number()
    max_product = 1
    num_with_max_product = ''
    for position in range(len(num) - num_adj_digits):
        product = 1
        for position_in_sequence in range(position, position + num_adj_digits):
            product *= int(num[position_in_sequence])
    if product > max_product:
        max_product = product
        num_with_max_product = num[position:position + num_adj_digits]
    print('{0} adjacent digits {1} have the greatest product of {2}'.format
        (num_adj_digits, num_with_max_product, max_product))


<mask token>

<mask token>


def assembly_number():
    number = ''
    for row in thousand_digits:
        number += str(row)
    return number


def solve_0008(num_adj_digits):
    num = assembly_number()
    max_product = 1
    num_with_max_product = ''
    for position in range(len(num) - num_adj_digits):
        product = 1
        for position_in_sequence in range(position, position + num_adj_digits):
            product *= int(num[position_in_sequence])
    if product > max_product:
        max_product = product
        num_with_max_product = num[position:position + num_adj_digits]
    print('{0} adjacent digits {1} have the greatest product of {2}'.format
        (num_adj_digits, num_with_max_product, max_product))


<mask token>

<mask token>


def assembly_number():
    number = ''
    for row in thousand_digits:
        number += str(row)
    return number


def solve_0008(num_adj_digits):
    num = assembly_number()
    max_product = 1
    num_with_max_product = ''
    for position in range(len(num) - num_adj_digits):
        product = 1
        for position_in_sequence in range(position, position + num_adj_digits):
            product *= int(num[position_in_sequence])
    if product > max_product:
        max_product = product
        num_with_max_product = num[position:position + num_adj_digits]
    print('{0} adjacent digits {1} have the greatest product of {2}'.format
        (num_adj_digits, num_with_max_product, max_product))


solve_0008(4)
solve_0008(13)

<mask token>
thousand_digits = ['73167176531330624919225119674426574742355349194934',
    '96983520312774506326239578318016984801869478851843',
    '85861560789112949495459501737958331952853208805511',
    '12540698747158523863050715693290963295227443043557',
    '66896648950445244523161731856403098711121722383113',
    '62229893423380308135336276614282806444486645238749',
    '30358907296290491560440772390713810515859307960866',
    '70172427121883998797908792274921901699720888093776',
    '65727333001053367881220235421809751254540594752243',
    '52584907711670556013604839586446706324415722155397',
    '53697817977846174064955149290862569321978468622482',
    '83972241375657056057490261407972968652414535100474',
    '82166370484403199890008895243450658541227588666881',
    '16427171479924442928230863465674813919123162824586',
    '17866458359124566529476545682848912883142607690042',
    '24219022671055626321111109370544217506941658960408',
    '07198403850962455444362981230987879927244284909188',
    '84580156166097919133875499200524063689912560717606',
    '05886116467109405077541002256983155200055935729725',
    '71636269561882670428252483600823257530420752963450']


def assembly_number():
    number = ''
    for row in thousand_digits:
        number += str(row)
    return number


def solve_0008(num_adj_digits):
    num = assembly_number()
    max_product = 1
    num_with_max_product = ''
    for position in range(len(num) - num_adj_digits):
        product = 1
        for position_in_sequence in range(position, position + num_adj_digits):
            product *= int(num[position_in_sequence])
    if product > max_product:
        max_product = product
        num_with_max_product = num[position:position + num_adj_digits]
    print('{0} adjacent digits {1} have the greatest product of {2}'.format
        (num_adj_digits, num_with_max_product, max_product))


solve_0008(4)
solve_0008(13)

'''
### Problem 0008 ### Largest product in a series ###
Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?
'''

thousand_digits = [
    '73167176531330624919225119674426574742355349194934',
    '96983520312774506326239578318016984801869478851843',
    '85861560789112949495459501737958331952853208805511',
    '12540698747158523863050715693290963295227443043557',
    '66896648950445244523161731856403098711121722383113',
    '62229893423380308135336276614282806444486645238749',
    '30358907296290491560440772390713810515859307960866',
    '70172427121883998797908792274921901699720888093776',
    '65727333001053367881220235421809751254540594752243',
    '52584907711670556013604839586446706324415722155397',
    '53697817977846174064955149290862569321978468622482',
    '83972241375657056057490261407972968652414535100474',
    '82166370484403199890008895243450658541227588666881',
    '16427171479924442928230863465674813919123162824586',
    '17866458359124566529476545682848912883142607690042',
    '24219022671055626321111109370544217506941658960408',
    '07198403850962455444362981230987879927244284909188',
    '84580156166097919133875499200524063689912560717606',
    '05886116467109405077541002256983155200055935729725',
    '71636269561882670428252483600823257530420752963450'
    ]

def assembly_number():
    number = ''
    for row in thousand_digits:
        number += str(row)
    return number

def solve_0008(num_adj_digits):
    num = assembly_number()
    max_product = 1
    num_with_max_product = ''

    for position in range(len(num)-num_adj_digits):
        product = 1
        for position_in_sequence in range(position, position + num_adj_digits):
            product *= int(num[position_in_sequence])
    if product > max_product:
            max_product = product
            num_with_max_product = num[position:position + num_adj_digits]
    print('{0} adjacent digits {1} have the greatest product of {2}'.format(num_adj_digits, num_with_max_product, max_product))

solve_0008(4)
solve_0008(13)
