zcmu-1022: Primes on Interval(素筛+二分+区间和）

Description

You've decided to carry out a survey in the theory of prime numbers. Let us remind you that a prime number is a positive integer that has exactly two distinct positive integer divisors.

Consider positive integers a, a + 1, ..., b (a ≤ b). You want to find the minimum integer l (1 ≤ l ≤ b - a + 1) such that for any integer x (a ≤ x ≤ b - l + 1) among l integers x, x + 1, ..., x + l - 1 there are at least k prime numbers.

Find and print the required minimum l. If no value l meets the described limitations, print -1.

Input

Everay line contains three space-separated integers a, b, k (1 ≤ a, b, k ≤ 106; a ≤ b).

Output

In a single line print a single integer — the required minimum l. If there's no solution, print -1.

Sample Input

2 4 2

6 13 1

1 4 3

Sample Output

3

4

-1

代码：

#include<bits/stdc++.h>
using namespace std;
#define maxn 1000005
int a,b,k;
int prime[maxn]={0};
int sum[maxn]={0}; 
int find(int x){
    for(int i=a;i<=b-x+1;i++){
        if(sum[i+x-1]-sum[i-1]<k)
        return 0;
    }
    return 1;
}
int main(){
    for(int i=2;i<maxn;i++){
        sum[i]=sum[i-1];
        if(prime[i]==0){
            sum[i]++;
            for(int j=1;j*i<=maxn;j++){
                prime[i*j]=1;
            }
        }
    }
    while(~scanf("%d%d%d",&a,&b,&k)){
        if(sum[b]-sum[a-1]<k){
            cout<<"-1\n";
            continue;
        }
        int left=1;
        int right=b-a+1;
        int num;
        while(left<=right){
            int mid=(left+right)/2;
            if(find(mid)==1){
                num=mid;
                right=mid-1;
            }
            else left=mid+1;
        }
        printf("%d\n",num);
    }
}