In [2]:

    

def t_n(t):
    n = 0 
    for i in t:
        n *= 10
        n += i
    return n
t_n((1,2,3))


    

    
Out[2]:





123

In [3]:

    

from itertools import permutations, combinations
splits = list((i,j) for i, j in combinations(range(1,9), 2))
found = set()
for i in permutations(range(1,10)):
    for f,t in splits:
        a, b, c =  t_n(i[:f]), t_n(i[f:t]), t_n(i[t:])
        if a*b == c:
            print('{}*{}={}'.format(a, b, c))
            found.add(c)


    

    




12*483=5796
138*42=5796
157*28=4396
159*48=7632
1738*4=6952
18*297=5346
186*39=7254
1963*4=7852
198*27=5346
27*198=5346
28*157=4396
297*18=5346
39*186=7254
4*1738=6952
4*1963=7852
42*138=5796
48*159=7632
483*12=5796

In [4]:

    

sorted(found)


    

    
Out[4]:





[4396, 5346, 5796, 6952, 7254, 7632, 7852]

In [5]:

    

sum(found)


    

    
Out[5]:





45228

In [ ]: