hdu 1397 Goldbach's Conjecture

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

#include<stdio.h>#include<iostream>int vis[32800];int check1(int n){    int i;    for(i=2;i*i<=n;i++)    {        if(n%i==0)        return 0;    }    return 1;}void check2(){    int i;    for(i=2;i<=32767;i++){        if(check1(i)) vis[i]=1;//是素数标记为1        else vis[i]=0;//否则标记0    }}int main(){    int N,i;    check2();    while(scanf("%d",&N),N)    {        int count=0;        for(i=2;i<=N/2;i++)        {            if(vis[i]&&vis[N-i])            count++;        }        printf("%d\n",count);    }    return 0;}