[Python] 백준 1929번 : 소수 구하기

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

 

 

---

 

import math

def solution(M, N):
    is_prime = [True] * (N+1)
    is_prime[0] = is_prime[1] = False
    
    for i in range(2, int(math.sqrt(N))+1):
    	if is_prime[i]:
            for j in range(i*i, N+1, i):
                is_prime[i] = False
    
    for k in range(M, N+1):
    	if (is_prime[k]==True):
        	print(k)
    

M, N = map(int, input().split())
solution(M, N)