POJ 2739 Sum of Consecutive Prime Numbers 素数线性打表+枚举

Sum of Consecutive Prime Numbers

Time Limit: 1000MS

 

Memory Limit: 65536K

Total Submissions: 28450

 

Accepted: 15252

Description

Some positive integers can be represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer have? For example, the integer 53 has two representations 5 + 7 + 11 + 13 + 17 and 53. The integer 41 has three representations 2+3+5+7+11+13, 11+13+17, and 41. The integer 3 has only one representation, which is 3. The integer 20 has no such representations. Note that summands must be consecutive prime 
numbers, so neither 7 + 13 nor 3 + 5 + 5 + 7 is a valid representation for the integer 20. 
Your mission is to write a program that reports the number of representations for the given positive integer.

Input

The input is a sequence of positive integers each in a separate line. The integers are between 2 and 10 000, inclusive. The end of the input is indicated by a zero.

Output

The output should be composed of lines each corresponding to an input line except the last zero. An output line includes the number of representations for the input integer as the sum of one or more consecutive prime numbers. No other characters should be inserted in the output.

Sample Input

2
3
17
41
20
666
12
53
0

Sample Output

1
1
2
3
0
0
1
2

Source

Japan 2005

算法分析:

题意:

给你一个数n,问你有多少这样连续的素数的数列的和为n。注意问你有多少个这样的数列,素数至少有一个,本身。

分析

 

素数线性打表,注意不一定要从第一个素数开始,所以一个个枚举。

 

代码实现

#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  
#include  

using namespace std;    
const long N = 11000;   
long prime[N] = {0},num_prime = 0;    
int isNotPrime[N] = {1, 1};   
int init()    
{     
     	for(long i = 2 ; i < N ; i ++)       
       	{            
		if(! isNotPrime[i])               
	 		prime[num_prime ++]=i;  
	   //无论是否为素数都会下来     
		for(long j = 0 ; j < num_prime && i * prime[j] <  N ; j ++)
    		{               
		      	isNotPrime[i * prime[j]] = 1;  
	  		if( !(i % prime[j] ) )  //遇到i最小的素数因子
	  			//关键处1                  
				break;           
		}        
	}        
	return 0;   
} 
int main()
{
	int n;
	init();
	while(scanf("%d",&n)!=EOF&&n!=0)
	{
		  int cnt=0;
		for(int i=0;i<=n;i++)
		{
		
			int sum=0;
			
			if(prime[i]>n)
				break;
			for(int j=i;;j++)
			{
				sum+=prime[j];
				
				if(sum==n)
				{
				   cnt++;
					
					break;
				}
				if(sum>n)
					break;
			}
			
		}
		printf("%d\n",cnt);
	}
} 

 

你可能感兴趣的:(2018暑假ACM集训,数学----数论)