zoukankan      html  css  js  c++  java
  • POJ2262Goldbach's Conjecture

    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
    

    CODE:

    View Code
     1 #include <iostream>
     2 #include <cstring>
     3 using namespace std;
     4 
     5 int isprime(int i)
     6 {
     7     for(int j=2; j*j<=i; j++)
     8     {
     9         //cout<<"j"<<endl;
    10         if(i%j==0)
    11         {
    12             //cout<<"out"<<endl;
    13             return 0;
    14         }
    15         //cout<<"j2"<<endl;
    16     }
    17 
    18     return 1;
    19 };
    20 
    21 int main()
    22 {
    23     int n;
    24 
    25     int i;
    26     while(cin>>n&&n)
    27     {
    28         i=2;
    29 
    30         for(i=2;i<=n/2;i++)
    31             if(isprime(i)&&isprime(n-i))
    32             {
    33                 cout<<n<<" = "<<i<<" + "<<n-i<<endl;
    34                 break;
    35             }
    36         if(i==(n/2 + 1))
    37         cout<<"Goldbach's conjecture is wrong."<<endl;
    38     }
    39     return 0;
    40 }



  • 相关阅读:
    js 获取时间差
    linq 两个list合并处理,并分组
    单例模式 双锁
    2018年的读书清单
    感悟
    asp.net使用Microsoft.mshtml提取网页标题等解析网页
    //利用反射快速给Model实体赋值
    C# url接口调用
    多字段动态查询
    对图片的操作
  • 原文地址:https://www.cnblogs.com/panderen/p/2439602.html
Copyright © 2011-2022 走看看