#define int ll
int prime[MAXN],cnt;
bool st[MAXN];//为假,是素数
void get_prime(int n)
{
memset(st,false,sizeof(st));
cnt=0;
for(int i = 2; i<= n; ++i)
{
if(!st[i]) prime[cnt++] = i;
for(int j=0;prime[j]*i<=n;++j)
{
st[prime[j]*i] = true;
if(i%prime[j]==0) break;
}
}
}
signed main()
{
int l,r;
while(cin>>l>>r)
{
get_prime(50000);
memset(st,false,sizeof(st));
if(l==1) ++l;
//用打的表把l,r中所有的合数筛出来
rep(i,cnt)
{
int p = prime[i];//注意j取值的时候不要取到p,把素数筛出去了,,
for(int j = max((l+p-1)/p*p,2ll*p);j<=r;j+=p) st[j- l] = true;//是合数
}
//遍历l,r把所有的素数找出来
cnt=0;
for(int i = l;i<=r;++i) if(!st[i- l]&&i>1) prime[cnt++] = i;
//遍历素数
if(cnt<=1) cout<<"There are no adjacent primes.\n";
else
{
int mx = 0,mn= 0;
rep(i,cnt-1)
{
int d= prime[i+1] - prime[i];
if(d>prime[mx+1] - prime[mx]) mx=i;
if(d<prime[mn+1] - prime[mn]) mn=i;
}
cout<<prime[mn]<<","<<prime[mn+1]<<" are closest, "<<prime[mx]<<","<<prime[mx+1]<<" are most distant.\n";
}
}
return 0;
}
AcWing 196. 质数距离 (线性筛)
最新推荐文章于 2022-05-07 23:12:20 发布