Created
January 9, 2019 00:30
-
-
Save x1001000/62b7e3926c4307096725fcc7b4a167f7 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
MAX = 1000000 | |
is_prime = [False,False]+[True]*(MAX-1) | |
primes = [] | |
now = 2 | |
while True: | |
primes.append(now) | |
for i in range(now*2, MAX+1, now): | |
is_prime[i] = False | |
now += 1 | |
try: | |
while is_prime[now] == False: | |
now += 1 | |
except: | |
break | |
while True: | |
try: | |
N = int(input()) | |
except: | |
break | |
if is_prime[N]: | |
M = int(str(N)[::-1]) | |
if is_prime[M] and M!=N: | |
print('%d is emirp.'%(N)) | |
else: | |
print('%d is prime.'%(N)) | |
else: | |
print('%d is not prime.'%(N)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment