forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp051.py
More file actions
52 lines (39 loc) · 1.13 KB
/
p051.py
File metadata and controls
52 lines (39 loc) · 1.13 KB
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
#
# Solution to Project Euler problem 51
# Copyright (c) Project Nayuki. All rights reserved.
#
# https://www.nayuki.io/page/project-euler-solutions
# https://github.com/nayuki/Project-Euler-solutions
#
import eulerlib
def compute():
isprime = eulerlib.list_primality(1000000)
for i in range(len(isprime)):
if not isprime[i]:
continue
n = [int(c) for c in str(i)]
for mask in range(1 << len(n)):
digits = do_mask(n, mask)
count = 0
for j in range(10):
if digits[0] != 0 and isprime[to_number(digits)]:
count += 1
digits = add_mask(digits, mask)
if count == 8:
digits = do_mask(n, mask)
for j in range(10):
if digits[0] != 0 and isprime[to_number(digits)]:
return str(to_number(digits))
digits = add_mask(digits, mask)
raise AssertionError("Not found")
def do_mask(digits, mask):
return [d * ((~mask >> i) & 1) for (i, d) in enumerate(digits)]
def add_mask(digits, mask):
return [d + ((mask >> i) & 1) for (i, d) in enumerate(digits)]
def to_number(digits):
result = 0
for d in digits:
result = result * 10 + d
return result
if __name__ == "__main__":
print(compute())