[交流] Euler 工程 第三十二题：pandigital 数 已有2人参与

from itertools import permutations

numbers = set(range(1,10))
results = []

for num in permutations(numbers, 4):
    n = int("%d"*4 % num)

    subset = numbers - set(num)

    # for #*####
    for x in subset:
        if n % x == 0:
            div = set([int(c) for c in str(n/x)])
            if len(div) == 4 and x not in div and div.issubset(subset):
                results.append(n)
                print "%d*%d=%d" % (x, n/x, n)
                break

    # for ##*###
    for x in permutations(subset, 2):
        xx = int("%d"*2 % x)
        if n % xx == 0:
            div = set([int(c) for c in str(n/xx)])
            if len(div) == 3 and x[0] not in div and x[1] not in div and div.issubset(subset):
                results.append(n)
                print "%d*%d=%d" % (xx, n/xx, n)
                break

print sum(set(results))

#!usr/bin/env python

from mytictoc import tic, toc

# 只有 #*#### 或者 ##*### 会产生 ####
# 否则 max(##*##) = 98*76 = 7448, len(98+76+7448)<9
# min(###*###) = 123*456 = 56088, len(123+456+56088)>9
# ##############
# 子函数,如果a,b,a*b包含1-9,返回true
def testProduct(a,b):
    if len(str(a)+str(b)+str(a*b))==9:
        return set(str(a)+str(b)+str(a*b))==set('123456789')
    else:
        return False

def euler32():

    tic()
   
    # 第一种情况: #*####
    num14 = [i*j for i in xrange(2,9) for j in xrange(1234,9876) if testProduct(i,j)]
   
    # 第二种情况: ##*###
    num23 = [i*j for i in xrange(12,98) for j in xrange(123,987) if testProduct(i,j)]

    # 组合2个list
    num14.extend(num23)
   
    # 打印结果
    print sum(list(set(num14)))

    toc()

if __name__=='__main__':
    euler32()

45228
Elapsed time: 0.32048878 seconds