hdu1397素数筛+打表+标记+二分

呵呵呵呵呵。。

代码：

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <vector>

using namespace std;

const int maxn = 1 << 15;

int f[maxn + 5] ;
vector<int> primes;
int v[maxn + 5];
int v1[maxn + 5];
void Eratoshenes(int n)   //素数筛
{
    int m = sqrt(n);
    memset(v,0,sizeof(v));
    v[0] = v[1] = 1;
    for(int i = 2; i <= m; ++i)
        if(!v[i])
            for(int j = i * i; j <= n; j += i)
                v[j] = 1;
    for(int i = 2;i <= maxn;++i)
        if(!v[i])
            primes.push_back(i);
}

int sss(int key,int l,int r)

{
    int m;
    while(l <= r)
    {
        m = (l + r) / 2;
        if(key == primes[m])
            return m;
        else if(key > primes[m])
            l = m +1;
        else
            r = m - 1;
    }
    return -1;
}
int main()

{
    Eratoshenes(maxn);
    int len = primes.size();
    f[4] = 1;
    f[5] = 1;
    f[6] = 1;
    for(int i = 7;i <= maxn;++i)
    {
        memset(v1,0,sizeof(v1));
        int cnt = 0;
        for(int j = 0;j < len;++j)
        {
            if(primes[j] > i)
                break;
            if(!v1[j] && !v[i - primes[j]] && !v1[i - primes[j]])
            {
                cnt++;
                v1[j] = v1[sss(i - primes[j],0,len)] = 1;
            }
        }
        f[i] = cnt;
    }
    int n;
    while(~scanf("%d",&n) && n)
    {
        printf("%d\n",f[n]);
    }
    return 0;
}