알고리즘
Sieve of Eratosthenes
이재현9999
2024. 10. 11. 19:27
import sys
input = sys.stdin.readline
M, N = map(int, input().split())
n = N
a = [False, False] + [True] * (n-1)
primes = []
for i in range(2, n + 1):
if a[i]:
primes.append(i)
for j in range(2 * i, n + 1, i):
a[j] = False
for num in primes:
if num >= M:
print(num)