27 lines
720 B
Python
27 lines
720 B
Python
import itertools
|
|
|
|
def is_prime(n):
|
|
if n == 2 or n == 3: return True
|
|
if n < 2 or n%2 == 0: return False
|
|
if n < 9: return True
|
|
if n%3 == 0: return False
|
|
r = int(n**0.5)
|
|
f = 5
|
|
while f <= r:
|
|
if n%f == 0: return False
|
|
if n%(f+2) == 0: return False
|
|
f +=6
|
|
return True
|
|
|
|
result=0
|
|
for i in range(1,1000001):
|
|
if not any(num in str(i) for num in ("0","2","4","6","8")):
|
|
x = list(itertools.permutations(str(i), len(str(i))))
|
|
x=["".join([str(a) for a in elem]) for elem in x]
|
|
if any([True for n in x if is_prime(int(n))]):
|
|
result+=1
|
|
print(result)
|
|
# for j in range(len(str(i))):
|
|
|
|
|