分拆素数和 加固版

# include<stdio.h>
# include<math.h>
# include<assert.h>
# include<iostream>
# include<algorithm>
using namespace std;
int is_prime(int n){
	int i,m;
	assert(n>=0);
	if(n==1){
		return 0;
	}
	m=floor(sqrt(n)+0.5);
	for(i=2;i<=m;i++){
		if(n%i==0){
			return 0;
		}
	}
		return 1;	
}
int main(){
	int n,i,k;
	while(scanf("%d",&n)!=EOF){
		k=0;
		if(n==0){
			break;
		}
		for(i=3;i<n/2;i=i+2){
			if(is_prime(i)&&is_prime(n-i)){
				k++;
			}
		}
		printf("%d\n",k);
	}
	return 0;
}