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
- Both a and b are prime
- a + b = n
- a ≤ b
Sample Input
2
6
4
Sample Output
Case 1: 1
Case 2: 1
Note
- 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, ...
题解:找出两个素数a,b相加等于n且a<=b。打表记录,要用bool形,一个字节,用int会memory limit。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int ans[1000010];
bool book[10000010];
void lin()
{
int l=0;
book[1]=1;
for(long long i=2; i<10000001; i++)
{
if(!book[i])
{
ans[l++]=i;
for(long long j=i*i; j<10000001 ; j+=i)
book[j]=1;
}
}
}
int main()
{
lin();
int t,o=1;
scanf("%d",&t);
while(t--)
{
int n,i,j,k=0;
scanf("%d",&n);
for(i=0; ans[i]<=n/2; i++)
if(!book[n-ans[i]])
k++;
printf("Case %d: %d\n",o++,k);
}
return 0;
}