2262. Goldbach's Conjecture
来源:互联网 发布:python list 去重 编辑:程序博客网 时间:2024/06/01 19:19
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
思路
这道题要验证1000000以内的哥德巴赫猜想。众所周知,1000000以内哥德巴赫猜想无疑是正确的,所以可以偷懒:程序不会输出”Goldbach’s conjecture is wrong.”
代码
#include<iostream>#include <math.h>using namespace std;bool isprime(int a){ int i = 0; for (i = 2; i <= sqrt(1.0 * a); i++) { if (a % i == 0) return false; } return true;}int main(){ int n = 0,j = 0; cin >> n; while (n) { for (j = 3; j < n; j++) //从最小的素数开始,求得的一定是相差最大的素数对 { if (isprime(n - j) && isprime(j)) { cout << n << " = " << j << " + " << n - j << endl; break; } } cin >> n; } return 0;}
- 2262. Goldbach's Conjecture
- Goldbach's Conjecture
- poj2262 Goldbach's Conjecture
- Goldbach's Conjecture
- Goldbach's Conjecture
- HOJ1459 Goldbach's Conjecture
- POJ2262 Goldbach's Conjecture
- 2262 Goldbach's Conjecture
- Goldbach's Conjecture
- POJ2262:Goldbach's Conjecture
- HDU1397:Goldbach's Conjecture
- Goldbach's Conjecture
- Goldbach's Conjecture
- poj2262 Goldbach's Conjecture
- poj_2262 Goldbach's Conjecture
- zoj_1657 Goldbach's Conjecture
- poj2262-Goldbach's Conjecture
- POJ2909:Goldbach's Conjecture
- 使用Nexus搭建Maven私服
- Cannot connect to the Docker daemon. Is the docker daemon running on this host?
- Hadoop2.6.5集群搭建(包含单节点安装方法)
- Hibernate中@OneToMany与ManyToOne的mappedBy和@JoinColumn区别
- kindeditor的使用心得
- 2262. Goldbach's Conjecture
- js中的预解析(变量提声)、作用域链、闭包机制
- JavaScript惰性载入函数
- 【PAT】【Advanced Level】1023. Have Fun with Numbers (20)
- maven打包报错:Failed to execute goal org.apache.maven.plugins:maven-surefire-plugin:2.5:test
- MariaDB开启慢查询日志
- 域名忘记续费后的问题
- display:table-cell的集中应用
- 解决Perhaps you are running on a JRE rather than a JDK ?的问题