Goldbach's Conjecture

O - Goldbach's Conjecture

Crawling in process... Crawling failed Time Limit:1000MS    Memory Limit:65536KB     64bit IO Format:%I64d & %I64u       

Description

For any even number n greater than or equal to 4, there exists at least one pair of prime numbersp₁ and p₂ such that

n = p₁ +p₂

This conjecture has not been proved nor refused yet. No one is sure whether this conjecture actually holds. However, one can find such a pair of prime numbers, if any, for a given even number. The problem here is to write a program that reports the number of all the pairs of prime numbers satisfying the condition in the conjecture for a given even number.

A sequence of even numbers is given as input. There can be many such numbers. Corresponding to each number, the program should output the number of pairs mentioned above. Notice that we are interested in the number of essentially different pairs and therefore you should not count (p₁,p₂) and (p₂,p₁) separately as two different pairs.

Input

An integer is given in each input line. You may assume that each integer is even, and is greater than or equal to 4 and less than 2¹⁵. The end of the input is indicated by a number 0.

Output

Each output line should contain an integer number. No other characters should appear in the output.

Sample Input

6
10
12
0

Sample Output

1
2
此题的解题思路：先建立一张素数表，我也是第一次接触，如果直接暴力，应该会超时的；
 
 
 
 
 
#include<iostream>
#include<cstring>
using namespace std;
int f[33000],prime[10000];
int count = 0;

void Select()//建立素数表
{
	for(int i=2;i<=32768;i++)
	{
		if(!f[i])
		{
			prime[count++]=i;
		}
		for(int j=i*i;j<=32768;j+=i)
		{
			f[j]=1;
		}
	}
}
int main()
{
	Select();
	int n,ans;
	while(cin>>n&&n)
	{
		ans=0;
	//	memset(f,0,sizeof(f));

		for(int i=0; 2*prime[i]<=n; i++)
			if(!f[n-prime[i]])
			{
				ans++;
			}
		cout<<ans<<endl;
	}
	return 0;
}