[백준온라인저지] 1747번 - 소수&팰린드롬

---

 

 

https://www.acmicpc.net/problem/1747

1747번: 소수&팰린드롬

 

import sys

n = int(sys.stdin.readline())

max = 1000001

sosu = [False, False] + [True] * (max-2)

for i in range(2, int(max ** 0.5) + 1):
    if sosu[i]:
        for j in range(i+i, max, i):
            if sosu[j]:
                sosu[j] = False

result = 0

for i in range(n, max):
    if str(i) == str(i)[::-1]:
        if sosu[i]:
            result = i
            break

    i += 1

if result == 0:
    result = 1003001

print(result)