Goldbach`s Conjecture（线性筛法）

Goldbach`s Conjecture

LightOJ - 1259

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 10⁷.

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 ≤ 10⁷, 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

题意：

给一个整数n，求它可由多少组素数相加

思路：

线筛求出1~10⁷之间的素数，设所有小于n/2的素数pi，判断n-pi是否为素数

ac代码：

#include <math.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include