[POJ 2689] Prime Distance

http://poj.org/problem?id=2689
题意:输入两个整数 1<=L< U<=2147483647 ,U - L <=1000000,要你求L到U中距离最近的两个素数个距离最远的两个素数。

思路:由于L和U太大了，但是U-L却并不大，所以我们可以将[L, U]区间映射到[1, U-L+1]，还有U的最小质因子是小于等于sqrt(U)的，所有我们先打好2-sqrt[(1<<31)-1]的素数表，然后用这些素数去筛选[L,R]里面的素数。

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

typedef long long ll;
const int maxn = 1000005;

ll prime[50005], top;
bool isprime[160005];
bool isprime_max[maxn];


void Prime(int n)  //线性筛选打表
{
    top = 0;
    memset(isprime, true, sizeof(isprime));
    for(int i = 2; i <= n; i++){
        if(isprime[i])
            prime[top++] = i;
        for(int k = 0; k < top && i*prime[k] <= n; k++){
            isprime[i*prime[k]] = false;
            if(i % prime[k] == 0)
                break;
        }
    }
}

int main()
{
    ll n, m;
    Prime(160000);//实际只要打到50000就够了
    while(cin>>n>>m){
        ll st = 0;
        ll ed = m / 2;
        if(m <= 2){
            cout<<"There are no adjacent primes."<<endl;
            continue;
        }
        while(prime[st]*prime[st] <= m) st++;
        st = max(n/prime[st], 2ll);
        memset(isprime_max, true, sizeof(isprime_max));
        //埃氏筛选
        for(ll i = 0; i < top; i++){
            for(ll k = max(2ll, n/prime[i]); k*prime[i] <= m; k++){
                if(k*prime[i] >= n)
                    isprime_max[k*prime[i]-n] = false;
            }
        }
        ll pre = -1;
        ll minl = 0, minr = 100000000;
        ll maxl = 0, maxr = 0;
        for(ll i = n; i <= m ; i++){
            if(i >= 2 && isprime_max[i-n]){
                if(pre != -1 && i - pre < minr - minl){
                    minr = i;
                    minl = pre;
                }
                if(pre != -1 && i - pre > maxr - maxl){
                    maxr = i;
                    maxl = pre;
                }
                pre = i; //前一个素数
            }
        }
        if(maxr - maxl == 0){
            cout<<"There are no adjacent primes."<<endl;
        }
        else{
            cout<<minl<<","<<minr<<" are closest, "<<maxl<<","<<maxr<<" are most distant."<<endl;
        }
    }
    return 0;
}