标签:prime 题型 13 integer 数论 positive 简单 input representations
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 <cstdio>
#include <cmath>
#include <cstring>
int n,ans;
int bb[1230],qu[10001],tt[10001];
int is_prime(int n)
{
if(n<2||(n!=2&&n%2==0))
return 0;
int i=3;
for(i=3;i<=sqrt(n);i+=2)
if(n%i==0)
return 0;
return 1;
}
int main()
{
int cnt=0;
for(int i=2;i<10001;++i)
{
if(is_prime(i))
qu[i]=1,bb[cnt++]=i;
tt[i]=cnt;
}
while(scanf("%d",&n)&&n)
{
ans=qu[n];
int i=2;
int count=0,j=0;
for(i=0;i<tt[n];i++)
{
if(bb[i]>n/2)
break;
count=0;
for(j=i;j<tt[n];++j)
{
count+=bb[j] ;
if(count>=n)
{
if(count==n)
ans++ ;
break ;
}
}
}
printf("%d\n",ans);
}
return 0 ;
}
标签:prime,题型,13,integer,数论,positive,简单,input,representations 来源: https://blog.csdn.net/qq_57504845/article/details/120317991
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。