2345: Prime Numbers…Again!
内存限制:128 MB
时间限制:1.000 S
评测方式:文本比较
命题人:
提交:41
解决:24
题目描述
We can write some of the numbers as the sum of some distinct consecutive prime numbers.
For instance, number 15 can be represented as 3+7+5=15
You are given a postive integer number 1<=n<=100000
and you should find the number of different ways that number n
can be represented as the sum of some distinct consecutive prime numbers.
输入
The number of test cases comes in the first line. For each test case you are given a positive integer
1<=n<=100000
输出
For each test case, print the number of the different ways that n
can be represented as a sum of some consecutive prime numbers.
样例输入 复制
2
3
17
样例输出 复制
1
2