poj 2739 Sum of Consecutive Prime Numbers (最大连续素数和)
2012-07-30 19:07
519 查看
点击打开链接
打表+求和..
打表+求和..
#include"stdio.h" #include"math.h" int prime[10010]; int count; void fun() { count=0; int i,j,k; for(i=2;i<=10000;i++) { k=(int)sqrt(i); int flag=1; for(j=2;j<=k;j++) { if(i%j==0) { flag=0; break; } } if(flag==1) prime[count++]=i; } } int main() { int cas; int n; int i,l; int sum; fun(); while(scanf("%d",&n)!=EOF&&n) { int m; m=0;cas=0; for(l=0;l<count;l++) { sum=0; if(prime[l]>n) break; for(i=l;i<count;i++) { sum+=prime[i]; if(sum==n) { cas++;break; } else if(sum>n) break; } } printf("%d\n",cas); } return 0; }
相关文章推荐
- poj 2739 Sum of Consecutive Prime Numbers (最大连续素数和)
- POJ 2739 Sum of Consecutive Prime Numbers 暴力枚举+素数判断
- POJ2739,Sum of Consecutive Prime Numbers,连续素数相加和,水过
- POJ 2739 Sum of Consecutive Prime Numbers(线性素数筛+前缀和)
- POJ 2739 Sum of Consecutive Prime Numbers-数论-(连续素数和)
- POJ 2739 Sum of Consecutive Prime Numbers(连续素数和)
- POJ 2739 Sum of Consecutive Prime Numbers(素数表)
- 【原】 POJ 2739 Sum of Consecutive Prime Numbers 筛素数+积累数组 解题报告
- poj 2739 Sum of Consecutive Prime Numbers 素数 读题 难度:0
- POJ2739 Sum of Consecutive Prime Numbers【素数筛选+尺取法】
- UVa 1210 - Sum of Consecutive Prime Numbers(素数+连续和)
- POJ 2739 Sum of Consecutive Prime Numbers(素数)
- POJ 2739 Sum of Consecutive Prime Numbers(素数打表 + 暴力)
- POJ 2739 Sum of Consecutive Prime Numbers(素数序列和,尺取法)
- poj 2739 Sum of Consecutive Prime Numbers【素数筛】
- POJ 2739 Sum of Consecutive Prime Numbers(素数打表+素数搜索)
- POJ2739 - Sum of Consecutive Prime Numbers(素数问题)
- POJ 2739 Sum of Consecutive Prime Numbers【素数打表】
- poj2739 Sum of Consecutive Prime Numbers 尺取法 素数打表
- POJ 2739 Sum of Consecutive Prime Numbers( *【素数存表】+暴力枚举 )