Problem 32
We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5 pandigital.
The product 7254 is unusual, as the identity, 39 × 186 = 7254, containing multiplicand, multiplier, and product is 1 through 9 pandigital.
Find the sum of all products whose multiplicand/multiplier/product identity can be written as a 1 through 9 pandigital.
HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.
# 寻找一组数,两个数之积是第三个数,这三个数是用完123456789且不重复。求所有的第三个数的和。
# 提示: 有的积可以有多种组合,总和中只能加入一次
# 思路:一共9位数,可能的组合是:2位*3位=4位,1位*4位=4位
将9个数字全排列,对每个组合进行判断
# a*bcde=fghi
# ab*cde=fghi
def full_permutation(number_str):
if len(number_str) == 1:
return number_str
result = []
for i in range(len(number_str)):
if i == len(number_str) - 1:
substr = number_str[:i]
else:
substr = number_str[:i] + number_str[i+1:]
for j in full_permutation(substr):
permu = (number_str[i] + j)
result.append(permu)
return result
number_str = '123456789'
sum_set = set()
for string in full_permutation(number_str):
if int(string[0]) * int(string[1:5]) == int(string[5:]) or \
int(string[:2]) * int(string[2:5]) == int(string[5:]):
print(string)
sum_set.add(int(string[5:]))
print(sum(sum_set))
结果:45228