POJ 3518 Prime Gap 筛法+二分 水题一个

Prime Gap

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 9622		Accepted: 5530

Description

The sequence of n − 1 consecutive composite numbers (positive integers that are not prime and not equal to 1) lying between two successive prime numbers p and p + n is called a prime gap of length n. For example, ‹24, 25, 26, 27, 28› between 23 and 29 is a prime gap of length 6.

Your mission is to write a program to calculate, for a given positive integer k, the length of the prime gap that contains k. For convenience, the length is considered 0 in case no prime gap contains k.

Input

The input is a sequence of lines each of which contains a single positive integer. Each positive integer is greater than 1 and less than or equal to the 100000th prime number, which is 1299709. The end of the input is indicated by a line containing a single zero.

Output

The output should be composed of lines each of which contains a single non-negative integer. It is the length of the prime gap that contains the corresponding positive integer in the input if it is a composite number, or 0 otherwise. No other characters should occur in the output.

Sample Input

10
11
27
2
492170
0

Sample Output

4
0
6
0
114

Source

Japan 2007

#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
const int INF =0x3f3f3f3f;
const int maxn= 1299709   ;

bool vis[maxn+5];
int n;
vector<int >ve;
void pre()
{
    for(int i=2;i*i<=maxn;i++)  if(!vis[i])
    {
        for(int j=i*i;j<=maxn;j+=i)
        {
            vis[j]=1;
        }
    }
    for(int i=2;i<=maxn;i++)  if(!vis[i])
    {
        ve.push_back(i);
    }
    n=ve.size();
}

void work(int x)
{
    if(!vis[x])  {puts("0");return;}
    int p=lower_bound(ve.begin(),ve.end(),x)-ve.begin();
    printf("%d\n",ve[p]-ve[p-1]);

}
int main()
{
    pre();
    int x;
    while(~scanf("%d",&x)&&x)
    {
        work(x);
    }


   return 0;
}