HDU2098（素数打表）

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

解题思路：

打出个素数表，然后两层循环暴力枚举计数。

完整代码：

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;

#pragma comment(linker, "/STACK:102400000,102400000")

typedef long long LL;
typedef double DB;
typedef unsigned uint;
typedef unsigned long long uLL;

/** Constant List .. **/ //{

const int MOD = int(1e9)+7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;

const int maxn = 10001;
int pri[maxn];
bool is_pri[maxn];
int cnt_pri;

void init()
{
    memset(is_pri , true , sizeof(is_pri));
    cnt_pri = 0;
    for(int i = 2 ; i < maxn ; i ++)
    {
        if(is_pri[i])
        {
            pri[cnt_pri++] = i;
            for(int j = i * i ; j < maxn ; j += i)
                is_pri[j] = false;
        }
    }
}

int solve(int n)
{
    int cnt = 0;
    for(int i = 0 ; pri[i] < n ; i ++)
    {
        for(int j = i + 1 ; pri[j] < n ; j ++)
        {
            if(pri[i] + pri[j] == n)
                cnt ++;
        }
    }
    return cnt;
}

int main()
{
    #ifdef DoubleQ
    freopen("in.txt" , "r" , stdin);
    #endif;
    init();
    int n;
    while(cin >> n)
    {
        if(n == 0)
            break;
        cout << solve(n) << endl;
    }
}