题意：

给一个数n，问1~n内有多少个素数

题目：

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

分析：

打个素数筛就行

AC模板：

#include<stdio.h>
#include<string.h>
#include<map>
#include<algorithm>
using namespace std;
const int M=1e6+10;
int n;
int dp[M],book[M];
map<int,int>mp;
void init()
{for(int i=2; i<M; i++){if(!book[i]){mp[i]=1;for(int j=i; j<M; j+=i)book[j]=1;}}for(int i=1; i<M; i++){dp[i]=dp[i-1];if(mp[i])dp[i]++;}
}
int main()
{init();while(~scanf("%d",&n)){printf("%d\n",dp[n]);}return 0;
}

备战ccpc分站赛ing ，题目分析简略，见谅，转载请注明出处。。。。。

Prime Number Aizu - 0009（素数筛）相关推荐

22行代码AC_Prime Number Aizu - 0009（素数筛）(解题报告)
励志用更少的代码做更高效的表达题意: 给一个数n,问1~n内有多少个素数题目: Write a program which reads an integer n and prints the nu ...
质数（prime number）又称素数，有无限个。质数定义为在大于1的自然数中，除了1和它本身以外不再有其他因数的数称为质数。合数（Composite number）是与质数对应的概念，在大于1
#include<bits/stdc++.h> using namespace std; int main() { int x,flag=0; cin>>x; ...
FZU 1649 Prime number or not (Miller-Rabin素数测试)
题目链接:http://acm.fzu.edu.cn/problem.php?pid=1649 题目大意:很直接,判断一个数n(2<=n<=10^18)是不是素数. 当n达到long ...
素数筛 Prime sieve
文章目录素数筛 Prime sieve 一.素数的判定二.埃氏筛法三.欧拉筛法四.六倍原理素数筛 Prime sieve 素数又称质数:一个大于 1 的自然数,除了 1 和它自身外,不能被其 ...
FZU 1649 Prime number or not （大素数测试）
题目链接 Problem 1649 Prime number or not Accept: 661 Submit: 3016 Time Limit: 2000 mSec Memory Li ...
Mysterious Bacteria(唯一质因子解+素数筛)
原题目: Dr. Mob has just discovered a Deathly Bacteria. He named it RC-01. RC-01 has a very strange rep ...
面试官本拿求素数搞我，但被我优雅的“回击“了(素数筛)
原创公众号(希望能支持一下):bigsai 转载请联系bigsai 文章收录在github 求star 前言现在的面试官,是无数开发者的梦魇,能够吊打面试官的属实不多,因为大部分面试官真的有那么那几 ...
筛表合集（素数筛欧拉函数筛莫比乌斯函数筛）
[目录] 一.素数筛 1.素数判断 2.素数普通筛 3.素数线性筛 4.素数区间筛二.欧拉函数筛三.莫比乌斯函数筛 [素数筛] 1.直接判定质数 bool judgePrime( int num ...
Project Euler 97 ：Large non-Mersenne prime 非梅森大素数
Large non-Mersenne prime The first known prime found to exceed one million digits was discovered in ...

Prime Number Aizu - 0009（素数筛）

题意：

题目：