poj2262裸的素数筛

有史以来第一次PE==
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;
}


全部评论

相关推荐

能干的三文鱼刷了10...:公司可能有弄嵌入式需要会画pcb的需求,而且pcb能快速直观看出一个人某方面的实力。看看是否有面试资格。问你问题也能ai出来,pcb这东西能作假概率不高
点赞 评论 收藏
分享
05-24 14:12
门头沟学院 Java
点赞 评论 收藏
分享
评论
点赞
1
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务