poj2262裸的素数筛

Goldbach's Conjecture
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 40400 Accepted: 15464

Description

In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:
Every even number greater than 4 can be
written as the sum of two odd prime numbers.

For example:
8 = 3 + 5. Both 3 and 5 are odd prime numbers.
20 = 3 + 17 = 7 + 13.
42 = 5 + 37 = 11 + 31 = 13 + 29 = 19 + 23.

Today it is still unproven whether the conjecture is right. (Oh wait, I have the proof of course, but it is too long to write it on the margin of this page.)
Anyway, your task is now to verify Goldbach's conjecture for all even numbers less than a million.

Input

The input will contain one or more test cases.
Each test case consists of one even integer n with 6 <= n < 1000000.
Input will be terminated by a value of 0 for n.

Output

For each test case, print one line of the form n = a + b, where a and b are odd primes. Numbers and operators should be separated by exactly one blank like in the sample output below. If there is more than one pair of odd primes adding up to n, choose the pair where the difference b - a is maximized. If there is no such pair, print a line saying "Goldbach's conjecture is wrong."

Sample Input

```8
20
42
0
```

Sample Output

```8 = 3 + 5
20 = 3 + 17
42 = 5 + 37
```
``````#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,prime[100000]={0};
int isprime[1000000]={1,1,0};
int main()
{
int q=0;
for(int i=2;i<1000000;i++)
{
//memset(isprime,1,sizeof(isprime));
if(!isprime[i])
{
prime[q]=i;q++;
}
for(int j=0;j<q&&i*prime[j]<1000000;j++)
{
isprime[prime[j]*i]=1;
if(!(i%prime[j])) break;
}
}
//for(int i=0;i<200;i++) printf("%d ",prime[i]);
while(~scanf("%d",&n)&&n)
{
for(int i=0;prime[i]<=n/2;i++)
{
if(!isprime[n-prime[i]])
{
printf("%d = %d + %d\n",n,prime[i],n-prime[i]);
break;
}
}
}
return 0;
}``````

2022-12-14 17:04

2022-12-20 13:54

2022-12-28 17:14

2022-12-26 23:50

2022-12-08 00:22

2022-12-14 18:10

2022-12-23 14:45

2022-12-31 20:32

2022-12-22 20:55

2022-12-28 02:13

2022-12-14 17:48

2022-12-22 18:27