从零开始刷PAT(数素数)

题目描述
令Pi表示第i个素数。现任给两个正整数M <= N <= 10000，请输出PM到PN的所有素数。

思路：
第10000个素数就是104729，数字并不大。可以利用平方根缩小遍历范围来查找，也可以采取剔除所有合数的方式，这里试试第二种。

package com.algorithm;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class PrimeNum {
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer stringTokenizer = new StringTokenizer(bufferedReader.readLine());
        int m = Integer.parseInt(stringTokenizer.nextToken());
        int n = Integer.parseInt(stringTokenizer.nextToken());
        bufferedReader.close();
        int c = 1;
        boolean[] booleans = new boolean[104730];
        booleans[0] = true;
        booleans[1] = true;
        int[] ints = new int[n - m + 1];
        //除2以外素数都是奇数，2单独处理
        if (m <= 1) {
            ints[0] = 2;
        }
        for (int i = 3; i < 104730; i += 2) {//选出所有奇数
            if (!booleans[i]) {
                for (int j = i + i; j <= 104729; j += i) {//把所有奇数的倍数都剔除
                    booleans[j] = true;
                }
            }
        }
        for (int i = 3; i <= 104730; i += 2) {//把2的倍数剔除就大功告成啦
            if (!booleans[i]) {
                c++;
                if (c >= m && c <= n) {
                    ints[c - m] = i;
                }
            }
        }
        for (int i = 0; i < ints.length; i++) {
            if ((i + 1) % 10 == 0 || i == ints.length - 1) {
                System.out.println(ints[i]);
            } else {
                System.out.print(ints[i] + " ");
            }
        }
    }
}