hdu 5104 筛素数打表＋暴力枚举

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#define MAX 10007

using namespace std;

int p[MAX],np;
int mark[MAX];

int n;

void init ( )
{
    int maxn = 10000;    
    for ( int i = 1 ; i <= maxn  ; i ++ ) mark[i] = 1;
    np = 1;
    mark[1] = 0;
    mark[0] = 0;
    for ( int i = 2 ; i <= maxn ; i++ )
    {
        if ( !mark[i] ) continue;
        mark[i] = np , p[np++] = i ;
        for ( int j = i*i ; j <= maxn ; j+=i )
            mark[j] = 0;
    }
}

int main ( )
{
   init ( );
   while ( ~scanf ( "%d" , &n ) )
   {
       int ans = 0;
       for ( int i = 1 ; i < np && p[i] <= n ; i++ )
           for ( int j = i ; j < np && p[j] <= n-p[i] ; j++ )
               if ( mark[n-p[i]-p[j]] >= j )
                  ans ++; 
       printf ( "%d\n" , ans );
   }
}