hdu1397 Goldbach's Conjecture

#include <stdio.h>
#include<string.h>
#define max 1000001

bool prime[max];

int main(){
    int t,i,j,sum,n;
	memset(prime,true,sizeof(prime));
	for(i=2;i<max;i++){
		if(prime[i]){
			for(j=2*i;j<max;j+=i)
				prime[j]=false;
		}
	}
	prime[1]=false;
	while(scanf("%d",&n) ,n){
		sum=0;
		for(i=2;i<=n/2;i++)
			if(prime[i] && prime[n-i])
				sum++;

		printf("%d\n",sum);
	}
    return 0;
}