Sum of Consecutive Prime Numbers

/*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
0Sample Output

4
0
6
0
114

这道题就是一道数论的水题，先构造素数表，然后判断输入的n是否为素数，如果是素数的话，直接输出0，如果不是素数的话找到两个连续的素数，分别大于n和小于n输出这两个素数的差就可以了。。

#include<stdio.h>
#include<string.h>
const int MAX=1299710;
bool is[MAX];
int prime[MAX],num;
int pri()
{
    int i,j,k=0;
 memset(is,true,sizeof(is));
 for(i=2;i<=MAX;i++)
 {
       if(is[i])
    {
     prime[k++]=i;
     for(j=i+i;j<=MAX;j+=i)
     {
      is[j]=false;
     }
    }
 }
 return k;
}
void solve(int x)
{
 int i,j=0;
 for(i=0;i<=num;i++)
 {
        if(x==prime[i])
  {
   j=1;
   printf("0\n");
   break;
  }
 }
 if(j==0)
 {
  for(i=0;i<=num;i++)
  {
   if(x>prime[i]&&x<prime[i+1])
   {
    printf("%d\n",prime[i+1]-prime[i]);
    break;
   }
  }
 }
}
int main()
{
 int n;
 num=pri();
 while(scanf("%d",&n)!=EOF)
 {
  if(n==0)
   break;
  solve(n);
 }
 return 0;
}

#include<iostream>
#include<cmath>
using namespace std;
bool prime(int x)
{
	int i;
	for(i=2;i<=(int)sqrt((double)x);i++)
	{
		if(x%i==0)
			return false;
	}
	return true;
}
int main()
{
	int n;
	while(cin>>n,n!=0)
	{
		if(prime(n))
		{
          cout<<"0"<<endl;
		}
		else
		{
			int x,y;
			x=n-1;
			y=n+1;
			while(!prime(x))
				x--;
			while(!prime(y))
				y++;
			cout<<y-x<<endl;
		}
	}
	return 0;
}