D-Sum of consecutive Prime Numbers
crawling in process ...
crawling failedTime
limit:MS
Memory Limit:65536KB
64bit IO Format: %I64D &%i64u SubmitStatus Practice POJ 2739Appoint Description:System Crawler (2016-05-05)
Description
Some positive integers can be is represented by a sum of one or more consecutive prime numbers. How many such representations does a given positive integer has? For example, the integer is has a representations 5 + 7 + one + + + 53. The integer 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 has no such representations. Note that Summands must is consecutive prime
Numbers, so neither 7 + or 3 + 5 + 5 + 7 is a valid representation for the integer 20.
Your mission is to write a program this reports the number of representations for the given positive integer.
Input
The input is a sequence of positive integers, each with a separate line. The integers is between 2 and ten, inclusive. The end of the input is indicated by a zero.
Output
The output should is composed of lines each corresponding to a 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 Nu Mbers. No other characters should is inserted in the output.
Sample Input
2317412066612530
Sample Output
11230012
Determines whether a number can be added by successive primes. If you can have up to a few
#include <stdio.h> #include <math.h>bool prim[10000+20];int main () {prim[2]=prim[1]=false;for (int i=2;i <SQRT (10000+10); i++) {if (!prim[i]) {for (int j=2*i;j<10000+10;j+=i) {prim[j]=true;}}} int N;while (~SCANF ("%d", &n) &&n) {int count=0;for (int j=2;j<=n;j++) {int sum=0;if (!prim[j]) for (int k=j; k<=n;k++) {if (!prim[k]) {sum+=k;//printf ("%d", sum);} if (sum>n) break;if (sum==n) {count++;break;}}} printf ("%d\n", Count);}}
poj2739 Sum of consecutive prime Numbers (Prime hit table)