「一本通 6.2 例 1」 UVA10140 Prime Distance[线性筛]

analysis

由于R太大,考虑求出$\sqrt{R}$内的所有质数,然后用类似刷表的方法来解决区间[L,R]的质数,然后对于区间[L,R]中的质数进行两两比较,最后求得最值
(在对于区间[L,R]中的质数进行两两比较时,真的不建议用while循环,细节太不好处理了)

code

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>
#include <bitset>
#include <ctime>
#include <cstring>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <climits>
#include <list>
using namespace std;
#define loop(i,start,end) for(int i=start;i<=end;++i)
#define anti_loop(i,start,end) for(int i=start;i>=end;--i)
#define clean(arry,num) memset(arry,num,sizeof(arry))
#define ll long long
#define isdegit(a) ((a>='0'&&a<='9'))

template<typename T>void read(T &x){
	x=0;char r=getchar();T neg=1;
	while(!isdegit(r)){if(r=='-')neg=-1;r=getchar();}
	while(isdegit(r)){x=(x<<1)+(x<<3)+r-'0';r=getchar();}
	x*=neg;
}

const ll maxl=(ll)INT_MAX+10;
const int maxLL=50000+10;
ll prime[maxLL];
ll v[maxLL];
ll cnt=0;
const int maxRL=1e6+10;
inline void shai(int n){
	loop(i,2,n){
		if(!v[i]){
			prime[++cnt]=i;
			v[i]=i;
		}
		loop(j,1,cnt){
			if(prime[j]*i>n||v[i]<prime[j])break;
			v[prime[j]*i]=prime[j];
		}
	}
	
}
bool ip[maxRL];
int main(){
	#ifndef ONLINE_JUDGE
	freopen("datain.txt","r",stdin);
	#endif
	cnt=0;
	clean(v,0);
	clean(prime,0);
	ll l,r;
	shai(50000);
	while(scanf("%lld%lld",&l,&r)!=EOF){
		clean(ip,false);
		int have=0;
		if(l==1)ip[0]=true,have=1;
		loop(i,1,cnt){
			if(prime[i]>r)break;
			int Ll=l/prime[i]-1,Rr=r/prime[i]+1;
			loop(j,Ll,Rr){
				if(j!=0&&j!=1&&j*prime[i]>=l&&j*prime[i]<=r){
					if(ip[(j*prime[i])-l]==false)++have;
					ip[(j*prime[i])-l]=true;
				}
			}
		}
		if(r-l+1-have<2){
			printf("There are no adjacent primes.\n");
		}
		else{
			ll max_l=-1,max_r=-1,min_l=0,min_r=r-l;
			ll p=0,p2;
			while(p+l==1||ip[p])
				++p; 
			while(1){
				p2=p+1;
				while(p2<=r-l&&ip[p2])
					++p2;
				if(p2<=r-l&&!ip[p2]){
					if(max_r-max_l<p2-p){
						max_r=p2;
						max_l=p;
					}
					if(min_r-min_l>p2-p){
						min_r=p2;
						min_l=p;
					}
					p=p2;
				}
				else if((p2==r-l&&ip[p2])||(p2>r-l)){
					break;
				} 
			}
			printf("%lld,%lld are closest, %lld,%lld are most distant.\n",l+min_l,l+min_r,l+max_l,l+max_r);
		}
	}
	return 0;
}