题目链接:点击这里
题目大意:
多组输入,每组输入给定
l
,
r
l,r
l,r ,求
l
l
l 到
r
r
r 之间相邻的差的绝对值最小以及最大的素数对
题目分析:
这个题的
1
≤
l
,
r
≤
2
31
−
1
,
1
≤
r
−
l
≤
1
e
6
1\le l,r \le 2^{31}-1,1\le r-l \le 1e6
1≤l,r≤231−1,1≤r−l≤1e6 ,显然要从
r
−
l
r-l
r−l 入手。我们知道判断
n
n
n 是不是素数只需要看到
n
\sqrt n
n 就可以了,我先筛了
5
e
4
5e4
5e4 的素数表然后用这些素数筛掉
l
l
l 到
r
r
r 中的合数,具体操作是先找到
l
l
l 到
r
r
r 中第一个是当前素数倍数的数然后用埃式筛的思路筛掉所有合数,最后扫一遍
l
l
l 到
r
r
r 就可以得到答案了,注意这个题的数据范围 我就是有个地方没用
l
o
n
g
l
o
n
g
long long
longlong 超时了一发
具体细节见代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define inf 0x3f3f3f3f
#define Inf 0x3f3f3f3f3f3f3f3f
using namespace std;
ll read()
{
ll res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 1e6+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
ll l,r,cnt,pri[maxn];
bool vis[maxn],vis2[maxn];
void get_prime(int n)
{
for(int i = 2;i <= n;i++)
{
if(!vis[i]) pri[++cnt] = i;
for(int j = 1;j <= cnt && i*pri[j] <= n;j++)
{
vis[i*pri[j]] = true;
if(i%pri[j] == 0) break;
}
}
}
int main()
{
get_prime(50000);
while(~scanf("%lld%lld",&l,&r))
{
ll sum = r-l+1;
memset(vis2,0,sizeof(vis2));
if(l == 1)
{
vis2[1] = true;
sum--;
}
for(ll i = 1;pri[i]*pri[i] <= r;i++)
{
for(ll j = l+(pri[i]-l%pri[i])%pri[i];j <= r;j += pri[i])
{
if(sum < 2) goto here;
if(j < 0 || pri[i] == j) continue;
if(!vis2[j-l+1]) sum--;
vis2[j-l+1] = true;
}
}
here:
if(sum < 2)
{
puts("There are no adjacent primes.");
continue;
}
ll minn = Inf,maxx = -Inf,minn1,minn2,maxx1,maxx2,last = 0;
for(ll i = l;i <= r;i++)
{
if(vis2[i-l+1]) continue;
if(last)
{
if(i-last > maxx)
{
maxx = i-last;
maxx1 = last;
maxx2 = i;
}
if(i-last < minn)
{
minn = i-last;
minn1 = last;
minn2 = i;
}
}
last = i;
}
printf("%lld,%lld are closest, %lld,%lld are most distant.\n",minn1,minn2,maxx1,maxx2);
}
return 0;
}