杭电5104Primes Problem

最新推荐文章于 2017-11-25 19:40:25 发布

hpuzsk

最新推荐文章于 2017-11-25 19:40:25 发布

阅读量417

点赞数

分类专栏：数学文章标签：杭电技巧

本文链接：https://blog.csdn.net/z8110/article/details/49621711

版权

数学专栏收录该内容

92 篇文章 0 订阅

订阅专栏

Primes Problem

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1945 Accepted Submission(s): 892

Problem Description

Given a number n, please count how many tuple(p1, p2, p3) satisfied that p1<=p2<=p3, p1,p2,p3 are primes and p1 + p2 + p3 = n.

Input

Multiple test cases(less than 100), for each test case, the only line indicates the positive integer

n(n≤10000) .

Output

For each test case, print the number of ways.

Sample Input

3
9

Sample Output

0
2

Source

BestCoder Round #18

Recommend

heyang | We have carefully selected several similar problems for you: 5551 5550 5549 5548 5547

打表：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[110000],i,j,k,l,m,n,prime[10000];
void get()//素数表 
{
    prime[0]=2;
    j=1;
    for(i=3;i<10000;i++)
    { 
    for(k=2;k*k<=i;k++)
    if((i%k==0))
    break;
    if(k*k>i)
    prime[j++]=i;
    } 
}
void ac()//结果表 
{
    get();
    memset(a,0,sizeof(a));
    for(i=0;i<470;i++)
    for(j=i;j<800;j++)
    {
        if(prime[i]+prime[j]>=10000)
        break;
        for(k=j;k<1229;k++)
        a[prime[i]+prime[j]+prime[k]]+=1;
    }    
}
int main()
{
    ac();
    while(scanf("%d",&k)!=EOF)
    printf("%d\n",a[k]);


}