zoukankan      html  css  js  c++  java
  • POJ 2909 Goldbach's Conjecture

    Goldbach's Conjecture
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 9192   Accepted: 5357

    Description

    For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that

    n = p1 + p2

    This conjecture has not been proved nor refused yet. No one is sure whether this conjecture actually holds. However, one can find such a pair of prime numbers, if any, for a given even number. The problem here is to write a program that reports the number of all the pairs of prime numbers satisfying the condition in the conjecture for a given even number.

    A sequence of even numbers is given as input. There can be many such numbers. Corresponding to each number, the program should output the number of pairs mentioned above. Notice that we are interested in the number of essentially different pairs and therefore you should not count (p1, p2) and (p2, p1) separately as two different pairs.

    Input

    An integer is given in each input line. You may assume that each integer is even, and is greater than or equal to 4 and less than 215. The end of the input is indicated by a number 0.

    Output

    Each output line should contain an integer number. No other characters should appear in the output.

    Sample Input

    6
    10
    12
    0

    Sample Output

    1
    2
    1

    Source

     
     
    #include<stdio.h>
    #include<string.h>
    
    const int maxn=100000;
    
    int prime[maxn+10];
    
    void getPrime(){
        memset(prime,1,sizeof(prime));
        prime[0]=prime[1]=0;
        for(int i=2;i*i<=maxn;i++)
            if(prime[i])
                for(int j=i*i;j<=maxn;j+=i)
                    prime[j]=0;
    }
    
    int main(){
    
        //freopen("input.txt","r",stdin);
    
        int n,cnt;
        getPrime();
        while(scanf("%d",&n) && n){
            cnt=0;
            for(int i=2;i<=n/2;i++)
                if(prime[i] && prime[n-i])
                    cnt++;
            printf("%d\n",cnt);
        }
        return 0;
    }
  • 相关阅读:
    【转】JavaScript里的this指针
    userscript.user.js 文件头
    css clearfix
    callback调用测试
    【个人】IIS Express 配置
    Js中 关于top、clientTop、scrollTop、offsetTop的用法
    【设为首页】/【收藏本站】
    JQuery插件开发
    Google Ajax Library API使用方法(JQuery)
    并发操作问题
  • 原文地址:https://www.cnblogs.com/jackge/p/2977726.html
Copyright © 2011-2022 走看看