![在这里插入图片描述](https://img-blog.csdnimg.cn/20190404092524269.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzEwNTExMA==,size_16,color_FFFFFF,t_70)
![在这里插入图片描述](https://img-blog.csdnimg.cn/20190404092536970.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzEwNTExMA==,size_16,color_FFFFFF,t_70)
埃氏筛代码
#include<bits/stdc++.h>
using namespace std;
const int n=10000005;
bool l[n];
void mmp()
{
fill(l,l+n,true);
for(int i = 2; i <= n; i++)
{
if(l[i])
{
for(int j = i*2; j <= n; j+=i) //寻找i的倍数
{
l[j]=false;
}
}
}
}
int main()
{
mmp();
l[1]=false;
int n,m;
scanf("%d%d",&a