44 lines
1.2 KiB
Python
44 lines
1.2 KiB
Python
#!/usr/bin/env python
|
|
"""
|
|
Created on 26 Feb 2021
|
|
|
|
@author: David Doblas Jiménez
|
|
@email: daviddoji@pm.me
|
|
|
|
Solution for problem 032 of Project Euler
|
|
https://projecteuler.net/problem=32
|
|
"""
|
|
|
|
from project_euler_python.utils import timeit
|
|
|
|
|
|
@timeit("Problem 032")
|
|
def compute():
|
|
"""
|
|
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 x 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.
|
|
"""
|
|
|
|
ans = set()
|
|
pandigital = [str(number) for number in range(1, 10)]
|
|
|
|
for x in range(1, 100):
|
|
for y in range(100, 10_000):
|
|
if sorted(str(x) + str(y) + str(x * y)) == pandigital:
|
|
ans.add(x * y)
|
|
|
|
return sum(ans)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(f"Result for Problem 032: {compute()}")
|