POJ - 3518 D - Prime Gap

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

打印出左右最近素数差值

如果为素数输出0

#include<iostream>
#include<cstring>
const int maxn = 1299709;
const int maxnn = 1299709 + 5;
int n;
int p[maxnn];
int vis[maxnn];
int pos[maxn];
using namespace std;

void init(){
    int tot = 0;
    for(int i = 2; i <= maxn; i++){
        if(!vis[i]){
            vis[i] = i;
            p[++tot] = i;
            if(tot >= 2){
                for(int j = p[tot - 1]; j < p[tot]; j++)
                    pos[j] = tot - 1;
            }
        }
        for(int j = 1; j <= tot; j++){
            if(p[j] > i || maxn < i * p[j])
                break;
            vis[p[j] * i] = p[j];
        }
    }

    /*for(int i = 2; i <= 10; i++){
        cout << pos[i] << endl;
    }*/
}

int main(){
    init();
    while(cin >> n && n){
        int ans = 0;
        if(vis[n] == n)//vis判素数
            cout << 0 << endl;
        else{
            ans = p[pos[n] + 1] - p[pos[n]];
            cout << ans << endl;
        }

    }

}