poj2739Sum of Consecutive Prime Numbers(打表)
2016-11-20 23:48
78 查看
原题链接
Sum of Consecutive Prime Numbers
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
Sample Output
题目大意就是让你求一个正数能有多少种连续的素数相加得到,素数本身也算一种。
解题思路:打表。。。,要注意数组的大小,开的太大会wa
Sum of Consecutive Prime Numbers
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 23879 | Accepted: 13017 |
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
题目大意就是让你求一个正数能有多少种连续的素数相加得到,素数本身也算一种。
解题思路:打表。。。,要注意数组的大小,开的太大会wa
#include #include const int MAX=10005; bool isprime[10005]; int prime[1230],top=0,num[10005]; void init(){ memset(isprime,true,sizeof(isprime)); for(int i=2;i10000){ break; } num[sum]++; } } } int main(){ int n; init(); solve(); while(scanf("%d",&n)!=EOF&&n){ printf("%d\n",num ); } }
相关文章推荐
- uva 138 Street Numbers(打表大法好)
- 九度1047(素数打表)
- hdu 4664 Triangulation 博弈论。。。。我把这题称作是花样打表。。受不了了,各种坑
- 【NYOJ-187】快速查找素数—— 枚举法、筛选法、打表法
- upc.2219: A^X mod P(打表 && 超越快速幂(in some ways))
- 第二届山东省ACM省赛回顾 Crack Mathmen(打表)
- 素数打表
- ACdream 1115 Salmon And Cat (找规律&&打表)
- NYOJ 45 棋盘覆盖(规律+大数+打表)
- poj 2379 连续素数和 打表
- Codeforces Gym 100418K Cards 暴力打表
- HDU 5391 Zball in Tina Town (打表,水)
- HDOJ 2041 超级楼梯 (打表法)
- HDU 2824 The Euler function【欧拉函数 打表】
- UVALive 6934 Good morning! 打表判断
- 2015北京网络赛 G Boxes BFS+打表
- 高效 大数素数打表
- UVA 11806-Cheerleaders-容斥原理+组合数打表
- poj Prime Distance 2689 (素数二次打表找最近与最远素数) 好题
- hdoj2098分拆素数和【打表】