소수 구하기

#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <cmath>
using namespace std;

int arr[1000001];

int main() {
	//freopen("input.txt", "rt", stdin);
	int m, n;
	cin >> m >> n;

	for (int i = 2; i <= 1000000; i++) {
		arr[i] = 1;
	}

	for (int i = 2; i <= 1000000; i++) {
		for (int j = 2 * i; j <= 1000000; j = j + i) {
			if (arr[j] == 0) {
				continue;
			}
			arr[j] = 0;
		}
	}

	for (int i = m; i <= n; i++) {
		if (arr[i] == 1) {
			printf("%d\n", i);
		}
	}

	return 0;
}