CF273c

C. Primes on Interval

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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

A single 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 test(s)

input

2 4 2

output

3

input

6 13 1

output

4

input

1 4 3

output

-1

题意，找到最小的L 使[x,b-l+1]内最少有K个素数

统计从一道两个端点间的素数个数作差 得到的即是两个数间的素数个数 

#include<cstdio>
#include<cstring>

#define ran 1010101 
int a,b,k;
bool p[ran];
int s[ran];
int ans;

void sieve()
{
	memset(p,true,sizeof p);
	p[1]=false;
	for(int i=2;i<=b;i++)
		if(p[i])
        {
			for(int j=i+i;j<=b;j+=i)// 数太大 不能用i*i，会超过int 范围
				p[j]=false;
		}
	memset(s,0,sizeof s);
	for(int i=1;i<=b;i++)
		s[i]=s[i-1]+p[i];
}

bool check(int l){
	for(int i=a;i+l-1<=b;i++)
		if(s[i+l-1]-s[i-1]<k)
			return false;
	return true;
}
int main()
{
	scanf("%d%d%d",&a,&b,&k);
	sieve();

	int lo=1,hi=b-a+1;
	ans=-1;
	while(lo<=hi)//二分查找最小的L
    {
		int mi=(lo+hi)>>1;
		if(check(mi))//如果符合 则往左查找
		{
			ans=mi;
			hi=mi-1;
		}
       else //否则向右查找
			lo=mi+1;
	}
	printf("%d\n",ans);
	return 0;
}