Goldbach's conjecture is one of the oldest unsolved problems in number theory and in all of mathematics. It states:
Every even integer, greater than 2, can be expressed as the sum of two primes [1].
Now your task is to check whether this conjecture holds for integers up to 107.
Input
Input starts with an integer T (≤ 300), denoting the number of test cases.
Each case starts with a line containing an integer n (4 ≤ n ≤ 107, n is even).
Output
For each case, print the case number and the number of ways you can express n as sum of two primes. To be more specific, we want to find the number of (a, b) where
1) Both a and b are prime
2) a + b = n
3) a ≤ b
Sample Input
2
6
4
Sample Output
Case 1: 1
Case 2: 1
Note 1. An integer is said to be prime, if it is divisible by exactly two different integers. First few primes are 2, 3, 5, 7, 11, 13, .
题意:求两个su's素数相加等于n,问一共有多少对。
思路:因为数据比较大,开Int型数组内存会抄,所以要开bool型数组判断数据是否为素数。
代码:
#include<cstdio>
#include<cstring>
#include<cmath>
#define MAXN 10000005
bool is_prime[MAXN];
int p[1000005],t,k,flag;
void prime()
{
for(int i=0;i<=MAXN;i++) is_prime[i]=true;
is_prime[0]=is_prime[1]=false;
k=0;
for(int i=2;i<=MAXN;i++)
{
if(is_prime[i]){
p[k++]=i;
for(int j=2*i;j<=MAXN;j+=i)
is_prime[j]=false;
}
}
}
int main()
{
prime();
flag=1;
scanf("%d",&t);
while(t--)
{
int x,sum=0;
scanf("%d",&x);
for(int i=0;p[i]<=x/2;i++)
if(is_prime[x-p[i]]) sum++;
printf("Case %d: %d\n",flag++,sum);
}
return 0;
}