POJ 2739 Sum of Consecutive Prime Numbers(水题)

Sum of Consecutive Prime Numbers

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 20560		Accepted: 11243

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

题目大意:

　　这道题是说，我给你一个数字n，然后你求出n==prime[i]+prime[i+1]+prime[i+2]+...+prime[i+tt]的方案数。

解题思路：

　　很水的一道题，上来后先打一个10000以内的素数表，然后你只需要处理好素数串的头和尾就行了，什么是头和尾呢？

就是for( int i = 1;prime[i] <= n;i++) ，因为我们这样想啊，如果prime[i] > n 的话，肯定是直接退出的，不用在判断了

然后内部的判断用一个tt变量边走边标记就好

代码：

# include<cstdio>
# include<iostream>
# include<fstream>
# include<algorithm>
# include<functional>
# include<cstring>
# include<string>
# include<cstdlib>
# include<iomanip>
# include<numeric>
# include<cctype>
# include<cmath>
# include<ctime>
# include<queue>
# include<stack>
# include<list>
# include<set>
# include<map>

using namespace std;

const double PI=4.0*atan(1.0);

typedef long long LL;
typedef unsigned long long ULL;

# define inf 999999999
# define MAX 10000+4

int prime[MAX];
int book[MAX];
int len = 0;

void init()
{
    for ( int i = 2;i <= MAX;i++ )
    {
        book[i] = 1;
    }
    for ( int i = 2;i <= MAX;i++ )
    {
        if ( book[i]==1 )
        {
            for ( int j = 2*i;j <= MAX;j+=i )
            {
                book[j] = 0;
            }
        }
    }
    len = 0;
    for ( int i = 2;i <= MAX;i++ )
    {
        if ( book[i]==1 )
        {
            prime[++len] = i;
        }
    }
   // for ( int i = 1;i <= len;i++ )
  //  {
  ////      cout<<prime[i]<<" ";
  //  }
  //  cout<<endl;

}


int main(void)
{
    init();
   // cout<<prime[1]<<endl;
    int n;
    while ( cin>>n )
    {
        if ( n==0 )
            break;

        int tot = 0;
        int temp = 0;
        int j = 1;

        for ( int i = 1;prime[i] <= n;i++ )
        {
            temp = 0;
            for ( int tt = i;tt <= len;tt++ )
            {
                temp+=prime[tt];
                if ( temp==n )
                {
                    tot++;
                    break;
                }
                if ( temp > n )
                {
                    break;
                }
            }
        }

        cout<<tot<<endl;

    }



    return 0;
}