baekjoon - python - 1929

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

1929번: 소수 구하기

# @Author YoungMinKim
# baekjoon
import sys
import math
def isPrime(num):
    if num == 1:return False
    n = int(math.sqrt(num))
    for i in range(2,n+1):
        if num % i == 0:
            return False
    return True
N,M = map(int,sys.stdin.readline().split())
for i in range(N,M+1):
    if isPrime(i):
        print(i)