• 1988 Goldbach's Conjecture(2)

    时间限制 : 2000/1000 MS(Java/Others) | 内存限制 : 131072/65536 KB(Java/Others)

    提交数 : 11 | 通过数 : 6

    题目描述

    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.

    输入要求

    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 2^15. The end of the input is indicated by a number 0.

    输出要求

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

    输入样例

    6
    10
    12
    0
    

    输出样例

    1
    2
    1

    提示


    来源

    Svenskt Mästerskap i Programmering/Norgesmesterskapet 2002

    [ 返回顶端 ] | [ 代码提交 ] | [ 统计数据 ] | [ 历史提交 ]