hdu 1397

用欧拉算法把32768以内的质数存在prime数组中

然后两头往中间加 小于n i++，大于n j--

#include <iostream>
#include <cmath>
using namespace std;
int prime[32768];
int vis[32768];

int main(int argc, char *argv[])
{
	int pos = 0,n,res,i,j;;
	memset(vis,0,sizeof(vis));
	for (i = 2;i <= 32768;i++){
		if (!vis[i]) prime[pos++] = i;
		for (j = 0;j < pos && prime[j]*i<=32768;j++){
			vis[prime[j]*i] = 1;
			if (i % prime[j] == 0) break;
		} 
	}
	
	while (cin>>n && n){
		i = 0,j = pos-1,res = 0;
		while (i <= j){
			if (prime[i]+prime[j] == n){
				res++;
				i++,j--;
			}
			else if (prime[i]+prime[j] < n) i++;
			else j--;
		}
		cout<<res<<endl;
	}
	return 0;
}