poj2909——Goldbach's Conjecture

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
bool prim[65535];
int queue[65535];
void solve()
{
memset(prim,true,sizeof(prim));
int front=0,rear=0;
rear++;queue[rear]=2;
while(front!=rear)
{
front++;
int k=2;
int index=k*queue[front];
while(index<65535)
{
prim[index]=false;
k++;
index=k*queue[front];
}
for(int i=queue[front]+1;i<65535;i++)
if(prim[i])
{
rear++;
queue[rear]=i;
break;
}
}
}
int main()
{
solve();
int n;
while(scanf("%d",&n)&&n)
{
int cnt=0;
for(int i=2;i<=n/2;i++)
{
if(prim[i]&&prim[n-i])
cnt++;
}
printf("%d/n",cnt);
}
return 0;
}