poj2262Goldbach's Conjecture(素数打表)
来源:互联网 发布:魔兽盒子mac 编辑:程序博客网 时间:2024/05/22 10:40
原题链接
Goldbach's Conjecture
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 44278 Accepted: 16922
Description
In 1742, Christian Goldbach, a German amateur mathematician, sent a letter to Leonhard Euler in which he made the following conjecture:
For example:
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.
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.
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
820420
Sample Output
8 = 3 + 520 = 3 + 1742 = 5 + 37解题思路:题意比较简单,就是输入一个偶数输出它由哪两个素数相加得到。我是打了个素数表然后判断i和n-i是不是同为素数。
1 0
- poj2262Goldbach's Conjecture(素数打表)
- POJ2262Goldbach's Conjecture素数判定
- HDU 1397 Goldbach's Conjecture(素数打表)
- hdoj 1397 Goldbach's Conjecture (大数素数打表)
- LightOj 1259-Goldbach`s Conjecture(素数打表)
- Goldbach`s Conjecture (数论,素数打表)
- Anti-Goldbach's Conjecture 素数打表
- ZOJ 1951 Goldbach's Conjecture(素数打表)
- poj 2262 Goldbach's Conjecture -- 筛法求素数打表
- POJ 2262 Goldbach's Conjecture 素数打表
- HDU——1397Goldbach's Conjecture(二分查找+素数打表)
- HDU——1397Goldbach's Conjecture(二分查找+素数打表)
- POJ 2262 Goldbach's Conjecture(素数表)
- POJ 2909 Goldbach's Conjecture(素数表)
- Goldbach's Conjecture map+素数表
- Goldbach's Conjecture(数论--素数判断)
- Goldbach`s Conjecture 素数筛选
- POJ 2262/ ZOJ 1951:Goldbach\'s Conjecture - 筛法打素数表
- Android JSON原生解析的几种思路,以号码归属地,笑话大全,天气预报为例演示
- Linux中sleep命令
- MySQL——报错:Can not issue data manipulation statements with executeQuery().
- bean的部分属性
- 关于iOS 后台执行任务
- poj2262Goldbach's Conjecture(素数打表)
- UML类图几种关系总结
- MySQL数据优化
- 【操作系统】学习笔记(三)基于时间片轮转的进程调度算法
- 字符串的旋转
- C语言变量声明问题——变量定义一定要放在所有执行语句/语句块的最前面吗?
- html布局中图片之间有间隙的解决方案
- ubuntu 16.04 tomcat8
- Soup爬百科并写入数据库