poj2262 Goldbach's Conjecture——筛素数

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int const maxn=1e6;
int n,pri[maxn+5],cnt;
bool vis[maxn+5];
void init()
{
    for(int i=2;i<=maxn;i++)
    {
        if(!vis[i])pri[++cnt]=i;
        for(int j=1;j<=cnt&&i*pri[j]<=maxn;j++)
        {
            vis[i*pri[j]]=1;
            if(i%pri[j]==0)break;
        }
    }
}
int main()
{
    init();
    while(1)
    {
        scanf("%d",&n);
        if(!n)return 0;
        for(int i=1;i<=cnt&&pri[i]<=n;i++)
        {
            if(!vis[n-pri[i]])
            {
                printf("%d = %d + %d\n",n,pri[i],n-pri[i]);
                break;
            }
        }
    }
}