POJ Goldbach's Conjecture
来源:互联网 发布:马龙 王皓 知乎 编辑:程序博客网 时间:2024/06/05 03:26
Language:
Goldbach's Conjecture
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 38074 Accepted: 14647
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
Source
Ulm Local 1998
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;#define maxn 1000005bool isprime[1000000];void make_prime(){ int tmp=sqrt(maxn+0.5); memset(isprime,false,sizeof(isprime)); for(int i=2;i<=tmp;i++) if(!isprime[i]) for(int j=i*2;j<=maxn;j+=i) isprime[j]=true;}int main(){ int n; int flag=0; make_prime(); while(~scanf("%d",&n)&&n) { flag=0; for(int i=2;i<n/2+1;i++) { if(!isprime[i]&&!isprime[n-i]) { printf("%d = %d + %d\n",n,i,n-i); flag=1; break; } } } return 0;}
0 0
- POJ Goldbach's Conjecture
- POJ Goldbach's Conjecture
- POJ 2909 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture
- POJ 2262 Goldbach’s Conjecture
- poj 2262 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture
- poj-2262 Goldbach's Conjecture
- poj-2262 Goldbach's Conjecture
- poj 2262 Goldbach's Conjecture
- poj 2909 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture
- POJ 2262 ----Goldbach's Conjecture
- Poj 2262 Goldbach's Conjecture
- poj 2262 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture
- POJ-2262-Goldbach's Conjecture
- 【线性代数】向量空间
- Android中Adapter之BaseAdapter使用
- 没事看看拉勾网,知道需求
- jQuery,使用on代替delegate,live 写法区别
- OA--对于每个form表单(<s:iterator>生成)的处理
- POJ Goldbach's Conjecture
- HDU-#4472 Count(DP)
- 枚举变量的大小是多少?
- dbms_shared_pool
- 使用elasticsearch提高hbase基于列的查询效率
- "PCH 警告:标头停止点不能位于宏或#if块中"
- 求集合的所有子集
- Ubuntu新建账户终端显示不正常问题
- 谱聚类算法详解