백준 1929번

원본 : www.acmicpc.net/problem/1929

1929번: 소수 구하기

 

풀이

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Main {

	public static void main(String[] args) throws Exception {

		BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
		BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));

		String str = reader.readLine();
		
		int m = Integer.parseInt(str.split(" ")[0]);
		int n = Integer.parseInt(str.split(" ")[1]);
		
		int arr[] = new int[n+1];
		for (int i = 1; i <= n; i++) {
			arr[i] = i;
		}
		
		for (int i = 2; i <= n; i++) {
			for (int j = i; j <= n; j += i) {
				if (arr[j] == 0) {
					continue;
				} else {
					if (j == i) {
						continue;
					} else {
						arr[j] = 0;
					}
				}
			}
		}
		
		if (m == 1) {
			m = 2;
		}
		for (int i = m; i < arr.length; i++) {
			if (arr[i] != 0) {
				writer.write(arr[i] + "\n");
			}
		}
		
		writer.flush();
	}
	
}