-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path_032.py
56 lines (45 loc) · 1.19 KB
/
_032.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
def digits(n):
ds = []
while n > 0:
ds.append(n % 10)
n //= 10
return ds
def is_pandigital(a, b, p):
cs = [0 for _ in range(10)]
for d in a:
if d == 0: return False
cs[d] += 1
if cs[d] >= 2: return False
for d in b:
if d == 0: return False
cs[d] += 1
if cs[d] >= 2: return False
for d in p:
if d == 0: return False
cs[d] += 1
if cs[d] >= 2: return False
return sum(cs) == 9
def is_under_digit_limit(a, b, p):
return len(a) + len(b) + len(p) <= 9
a, b = 1, 1
all_pandigial_products = []
unique_products = set()
while True:
b = 1
digits_a = digits(a)
while True:
p = a * b
digits_b = digits(b)
digits_p = digits(p)
if is_pandigital(digits_a, digits_b, digits_p):
print(a, b, p)
all_pandigial_products.append((a, b, p))
unique_products.add(p)
if not is_under_digit_limit(digits_a, digits_b, digits_p):
break
b += 1
if not is_under_digit_limit(digits_a, [1], digits_a):
break
a += 1
print(len(all_pandigial_products))
print(sum(unique_products))