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 integerx (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 Input
2 4 2
3
6 13 1
4
1 4 3
-1
#include<stdio.h> #include<string.h> #include<iostream> #include<algorithm> using namespace std; int f[1000010],sum[1000010],a,b,k; void init() { f[0]=1; f[1]=1; for(int i=2;i<=1000000;i++) { if(f[i]==0) { for(int j=i+i;j<=1000000;j+=i) f[j]=1; } } sum[0]=sum[1]=0; for(int i=2;i<=1000000;i++) { if(f[i]==0) sum[i]=sum[i-1]+1; else sum[i]=sum[i-1]; } } int fun(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() { init(); scanf("%d %d %d",&a,&b,&k); if(sum[b]-sum[a-1]<k) printf("-1\n"); else { int start=1,end=b-a+1,ans=0; while(start <= end) { int mid = (start + end) / 2; if(fun(mid)) { ans=mid; end = mid-1; } else start = mid + 1; } if(ans == 0) puts("-1"); else printf("%d\n",ans); } }