LightOj 1259-Goldbach`s Conjecture（素数打表）

Description

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

#include <stdio.h>
#include <cmath>
const int maxn = 1e7+5;
bool is_prime[maxn];
int p[1001234] = { 0 }, tol = 0;

void init()
{
	for (int i = 2; i < maxn; i++)
	if (!is_prime[i])
	{
		p[tol++] = i;
		for (int j = 2 * i; j < maxn; j += i)
			is_prime[j] = true;
	}
}

int main()
{
	init();
	int T, cc = 1;
	scanf("%d", &T);
	while (T--)
	{
		int n, ans = 0;
		scanf("%d", &n);
		for (int i = 0; i < tol; i++)
		{
			if (p[i]>n / 2) break;
			if (!is_prime[n - p[i]]) ans++;
		}
		printf("Case %d: %d\n", cc++, ans);
	}
	return 0;
}