Prime Distance

题目传送门sxazr
本题由于题中所给的L和R过大，无法直接用数组储存，那么可以把L到R之间的数减去L再做标记，判断时也减L就行；
代码

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
bool v[1000001];
int a[100001],m,l,r,b[1000001];
void zr()
{
	for(int i=2;i<=46340;i++)
	  if(!v[i]){
	  	a[++m]=i;
	  	for(int j=i;j<=46340/i;j++) v[i*j]=1;
	  }
}
int main()
{
	zr();
	while(scanf("%d%d",&l,&r)==2){
		memset(v,0,sizeof(v));
		if(l==1) v[0]=1;
		for(int i=1;i<=m;i++)
		  for(int j=l/a[i];j<=r/a[i];j++)
		    if(j>1) v[a[i]*j-l]=1;
		int n=0;
		for(int i=l;i<=r;i++){
			if(!v[i-l]) b[++n]=i;
			if(i==r) break;
		}
		int t1=2147483647,t2=0,x1,x2,y1,y2;
		for(int i=1;i<n;i++){
			int j=b[i+1]-b[i];
			if(j<t1) {t1=j;x1=b[i];y1=b[i+1];}
			if(j>t2) {t2=j;x2=b[i];y2=b[i+1];}
		}
		if(!t2) printf("There are no adjacent primes.\n");
		else printf("%d,%d are closest, %d,%d are most distant.\n",x1,y1,x2,y2);
	}
	return 0;
}