HDOJ 5104 Primes Problem

题意：给出一个数n，求出n能分解为多少组三个素数的和。（p1+p2+p3=n && p1 <= p2 <=p3 &&p1,p2,p3均为素数）

链接：http://acm.hdu.edu.cn/showproblem.php?pid=5104

思路：筛法求素数表，枚举求解。

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
12479021	2014-12-12 18:49:09	Accepted	5104	109MS	1680K	1550 B	G++	luminous11

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;

bool prime[100005];
int num[100005];

int main()
{
    memset ( prime, 1, sizeof ( prime ) );
    prime[0] = prime[1] = false;
    for ( int i = 2; i < 10005; i ++ )
    {
        if ( prime[i] )
        {
            for ( int j = i * i; j < 10005; j += i )
            {
                prime[j] = false;
            }
        }
    }
    int cnt = 0;
    for ( int i = 2; i < 100005; i ++ )
    {
        if ( prime[i] )
        {
            num[cnt++] = i;
        }
    }
    int n;
    while ( cin >> n )
    {
        cnt = 0;
        for ( int i = 0; num[i] < n; i ++ )
        {
            for ( int j = i; num[j] < n; j ++ )
            {
                if ( prime[n - num[i] - num[j]] && ( n - num[i] - num[j] ) >= num[j] )
                {
                    cnt ++;
                }
            }
        }
        cout << cnt << endl;
    }
    return 0;
}