AOJ0009 Prime Number

Prime Number
Aizu - 0009
Write a program which reads an integer n and prints the number of prime numbers which are less than or equal to n. A prime number is a natural number which has exactly two distinct natural number divisors: 1 and itself. For example, the first four prime numbers are: 2, 3, 5 and 7.

Input
Input consists of several datasets. Each dataset has an integer n (1 ≤ n ≤ 999,999) in a line.

The number of datasets is less than or equal to 30.

Output
For each dataset, prints the number of prime numbers.

Sample Input
10
3
11
Output for the Sample Input
4
2
5
题目链接

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
const int N=1e6;
bool is_prime[N];
void sieve(){
	memset(is_prime,true,sizeof(is_prime));
	is_prime[0]=is_prime[1]=false;
	for(int i=2;i<N;i++){
		if(is_prime[i]){
			for(int j=i*2;j<N;j+=i){
				is_prime[j]=false;
			}
		}
	} 
}
int main(){
	sieve();
	int n;
	while(cin>>n){
		int ans=0;
		for(int i=0;i<=n;i++){
			if(is_prime[i]) ans++;
		}
		cout<<ans<<endl;
	}
}