[BOJ] 백준 1929 소수 구하기

[문제]

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

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Main {
	static int n,m;
	static boolean[] prime = new boolean[1000001];
	public static void main(String[] args) throws IOException {
    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    	StringTokenizer st = new StringTokenizer(br.readLine());
    	m = Integer.parseInt(st.nextToken());
    	n = Integer.parseInt(st.nextToken());
    	isPrime();
    	
	}
	private static void isPrime() {
		Arrays.fill(prime,true);
		prime[1] = false;
		for(int i=2;i*i<=1000000;i++) {
			if(!prime[i]) continue;
			for(int j=i*i;j<=1000000;j+=i) {
				prime[j] = false;
			}
		}
		for(int i=m;i<=n;i++) {
			if(prime[i])
				System.out.println(i);
		}
	}
}