素数的个数（Java）

埃氏筛法

import java.util.*;

public class Main{
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		sc.close();
		int[] prime = new int[1000001];
		boolean[] is_prime = new boolean[100000002];
		int p = 0;
		for(int i = 0;i <= n;i++) {
			is_prime[i] = true;
		}
		is_prime[0] = is_prime[1] = false;
		for(int i = 2;i <= n;i++) {
			if(is_prime[i]) {
				prime[p++] = i;
				for(int j = 2*i;j <= n;j += i) {
					is_prime[j] = false;
				}
			}
		}
		System.out.println(p);
		
	}

}