zoukankan      html  css  js  c++  java
  • poj 2262 Goldbach's Conjecture(素数筛选法)

    http://poj.org/problem?id=2262

    Goldbach's Conjecture
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 34323   Accepted: 13169

    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
    

    Source

     
    【题解】:
    题意:输入一个偶数n,将n分成两个素数和,找到第一组就可以(n=a+b,a尽量小)
    n最大1000000
    方法:素数筛选法
    【code】:
     1 /**
     2 Judge Status:Accepted    Memory:4852K
     3 Time:344MS    Language:G++
     4 Code Lenght:797B    Author:cj
     5 */
     6 #include <iostream>
     7 #include <stdio.h>
     8 #include <string.h>
     9 #include <algorithm>
    10 
    11 #define N 1000000
    12 using namespace std;
    13 
    14 int prim[N+10];
    15 int arrPrim[N+10];
    16 
    17 int main()
    18 {
    19     int i,j;
    20     memset(prim,0,sizeof(prim));
    21     for(i=2;i*i<=N;i++)  //素数筛选法
    22     {
    23         if(!prim[i])
    24         {
    25             for(j=2;j*i<=N;j++)
    26             {
    27                 prim[j*i]=1;
    28             }
    29         }
    30     }
    31     int arr_cnt=0;
    32     for(i=3;i<=N;i++)
    33     {
    34         if(!prim[i]) arrPrim[arr_cnt++]=i;  //一次遍历赛选出来的素数存入数组,遍历用
    35     }
    36     int n;
    37     while(~scanf("%d",&n)&&n)
    38     {
    39         for(i=0;i<arr_cnt;i++)
    40         {
    41             if(!prim[n-arrPrim[i]])
    42             {
    43                 printf("%d = %d + %d
    ",n,arrPrim[i],n-arrPrim[i]);
    44                 break;
    45             }
    46         }
    47     }
    48     return 0;
    49 }
  • 相关阅读:
    php configure help
    ubuntu下编译安装PHP
    【转】Ubuntu编译安装mysql源码
    Java 处理异常 9 个最佳实践,你知道几个?
    HashMap工作原理
    LinkedList
    SpringMVC常用注解@Controller,@Service,@repository,@Component
    HTML5 APP应用实现图片上传及拍照上传功能
    bootstrap-datepicker 与bootstrapValidator同时使用时,选择日期后,无法正常触发校验
    js
  • 原文地址:https://www.cnblogs.com/crazyapple/p/3277036.html
Copyright © 2011-2022 走看看