二分查找

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 <algorithm>
#include <cstring>
#include <stdio.h>
#include <vector>;
using namespace std;
const int maxn = 1e6 + 100;
bool prim[maxn];
vector <int> ve;

void get_prim() {
    prim[0] = prim[1] = true;
    for (int i = 2; i<maxn; i++) {
        if (prim[i])
            continue;
        ve.push_back(i);
        for (int j = i * 2; j<maxn; j += i) {
            prim[j] = true;
        }
    }
}

int main() {
    int n;
    get_prim();
    while (scanf("%d", &n) != EOF) {
        int pos = upper_bound(ve.begin(), ve.end(), n) - ve.begin();
        if (ve[pos] > n)
            pos--;
        printf("%d\n", pos + 1);
    }
    return 0;
}