Prime Distance

Description

The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of primality. A prime number is a number that is has no proper factors (it is only evenly divisible by 1 and itself). The first prime numbers are 2,3,5,7 but they quickly become less frequent. One of the interesting questions is how dense they are in various ranges. Adjacent primes are two numbers that are both primes, but there are no other prime numbers between the adjacent primes. For example, 2,3 are the only adjacent primes that are also adjacent numbers. 
Your program is given 2 numbers: L and U (1<=L< U<=2,147,483,647), and you are to find the two adjacent primes C1 and C2 (L<=C1< C2<=U) that are closest (i.e. C2-C1 is the minimum). If there are other pairs that are the same distance apart, use the first pair. You are also to find the two adjacent primes D1 and D2 (L<=D1< D2<=U) where D1 and D2 are as distant from each other as possible (again choosing the first pair if there is a tie).

Input

Each line of input will contain two positive integers, L and U, with L < U. The difference between L and U will not exceed 1,000,000.

Output

For each L and U, the output will either be the statement that there are no adjacent primes (because there are less than two primes between the two given numbers) or a line giving the two pairs of adjacent primes.

Sample Input

2 17
14 17

Sample Output

2,3 are closest, 7,11 are most distant.
There are no adjacent primes.
　　
题意：给定一个区间，找去这个区间里相邻的最近的和最远的两组素数。
思路：根据题目中的数据范围，可以看出要用到埃式筛法，直接暴力肯定是不行的，然后直接无脑写就行了，好吧这就是我调了两天才AC的原因，我用的是挑战程序设计竞赛的模板。。。。。。阿西吧。
一直过不了，不废话了，具体看代码中的注释吧。

#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <cmath>
#include <ctime>
#include <string>
#include <limits>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <cstdlib>
#include <cstring>
#include <istream>
#include <iostream>
#include <algorithm>
#define ci cin
#define co cout
#define el endl
#define Scc(c) scanf("%c",&c)
#define Scs(s) scanf("%s",s)
#define Sci(x) scanf("%d",&x)
#define Sci2(x, y) scanf("%d%d",&x,&y)
#define Sci3(x, y, z) scanf("%d%d%d",&x,&y,&z)
#define Scl(x) scanf("%I64d",&x)
#define Scl2(x, y) scanf("%I64d%I64d",&x,&y)
#define Scl3(x, y, z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define Pri(x) printf("%d
",x)
#define Prl(x) printf("%I64d
",x)
#define Prc(c) printf("%c
",c)
#define Prs(s) printf("%s
",s)
#define For(i,x,y) for(int i=x;i<y;i++)
#define For_(i,x,y) for(int i=x;i<=y;i++)
#define FFor(i,x,y) for(int i=x;i>y;i--)
#define FFor_(i,x,y) for(int i=x;i>=y;i--)
#define Mem(f, x) memset(f,x,sizeof(f))
#define LL long long
#define ULL unsigned long long
#define MAXSIZE 1000005
#define INF 0x3f3f3f3f

const int mod=1e9+7;
const double PI = acos(-1.0);

using namespace std;

bool is_prime[MAXSIZE];
bool is_prime_small[MAXSIZE];
//is_prime[i-a]=true--->i是素数
void solve(LL a,LL b)
{
    for(int i=0; (LL)i*i<=b; i++)
        is_prime_small[i]=true;
    //is_prime_small[0]=is_prime_small[1]=false;
    for(int i=0; i<=b-a; i++)
        is_prime[i]=true;
    if(a==1)
        is_prime[0]=0;//就是这个特判，我调了一天才搞出来 。。。。。。
    for(int i=2; (LL)i*i<=b; i++)
        if(is_prime_small[i])
        {
            for(int j=2*i; (LL)j*j<=b; j+=i)
                is_prime_small[j]=false;//筛2~根号b
            for(LL j=max(2LL,(a+i-1)/i)*i; j<=b; j+=i)
                is_prime[j-a]=false;//筛a~b
        }
}
//j = (ll)(a-1+i)/i*i
//(a-1+i)/i*i是对a/i向上取整,此计算的作用是求得第一个>=a的i的倍数。
//for(LL j=max(2LL,(a+i-1)/i)*i; j<=b; j+=i)这个循环的初始条件还是不懂

int main()
{
    LL a,b;
    LL c1,c2,d1,d2;
    while(~Scl2(a,b))
    {
        solve(a,b);
        int tmp=-1;
        int minn=INF,maxx=-1;
        queue<int>q1,q2;
        For_(i,a,b)
        {
            if(is_prime[i-a])
            {
                if(tmp!=-1)
                {
                    if(i-tmp<minn)
                    {
                        minn=i-tmp;
                        c1=tmp;
                        c2=i;
                    }
                    if(i-tmp>maxx)
                    {
                        maxx=i-tmp;
                        d1=tmp;
                        d2=i;
                    }
                }
                tmp=i;
            }
        }
        if(minn!=INF||maxx!=-1)
            cout<<c1<<","<<c2<<" are closest, "<<d1<<","<<d2<<" are most distant."<<endl;
        else
            Prs("There are no adjacent primes.");
    }
    return 0;
}