KEEP GOING

[소수&팰린드롬] https://www.acmicpc.net/problem/1747 1. 코드 구현 (하) from math import sqrt import sys input = sys.stdin.readline def isPrime(num): if num == 1: return False for i in range(2, int(sqrt(num))+1): if num % i == 0: return False return True def isPalindrome(num): data = str(num) k = len(data) for i in range(k//2): if data[i] != data[k-1-i]: return False return True n = int(input()) while True:..