POJ 2739 Sum of Consecutive Prime Numbers(素数打表 + 暴力)

Total Submission(s) : 7   Accepted Submission(s) : 4

Problem 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
  
  

 

有多少个素数组合可以组成给出的数（素数组合必须是连续递增素数

打表 + 暴力；

#include <iostream>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <utility>
using namespace std;
const int maxn = 10050;
int prim[maxn];
int num[maxn];
int k;
void get_prim() {
    k = 1;
    memset(num, 1, sizeof(num));
    for (int i = 2; i < maxn; ++i) {
        if (num[i]) {
            for (int j = 2 * i; j < maxn; j += i) {
                num[j] = 0;
            }
            prim[k++] = i;
        }
    }
}
int ans;
int fk;
void dfs(int num, int sum) {
    if (sum + prim[num] == fk) {
        ans++;
        return;
    } else if (sum + prim[num] > fk) {
        return;
    } else {
        dfs(num + 1, sum + prim[num]);
    }
}
int main() {
        //freopen("in.txt", "r", stdin);
    get_prim();
    while (cin >> fk && fk) {
        ans = 0;
        for (int i = 1; i < k; ++i)
            dfs(i, 0);
        cout << ans << endl;
    }
}