백준_1929_소수 구하기

#include <iostream>

using namespace std;

bool sosu[1000001] = { false };
int M, N;

int main() {
    cin >> M >> N;
    for (int i = 2; i <= N; i++) 
        for (int j = 2; i*j <= N; j++) 
            sosu[i*j] = true;

    for (int i = (M < 2 ? 2 : M); i <= N; i++) 
        if (!sosu[i]) printf("%d\n", i);

    return 0;
}