POJ-2262-Goldbach's Conjecture-2013-11-28 23:15:10
来源:互联网 发布:阿里云丁丁 编辑:程序博客网 时间:2024/06/04 17:45
Goldbach's Conjecture
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 35410 Accepted: 13584
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<stdio.h># include<string.h>int prime[1100000];void isprimer(){int i,j;memset(prime,0,sizeof(prime));for(i=2;i<=1000000;i++)if(prime[i]==0)for(j=2*i;j<=1000000;j+=i)prime[j] = 1;}int main(){int t,i;isprimer();while(scanf("%d",&t) && t!=0){for(i=3;i<=t/2;i+=2){if((prime[i]==0) && (prime[t-i]==0)){printf("%d = %d + %d\n",t,i,t-i);break;}}}return 0;}
0 0
- POJ-2262-Goldbach's Conjecture-2013-11-28 23:15:10
- 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 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 2262 Goldbach's Conjecture
- Ubuntu安装配置Mysql
- Binary Search Tree vs Hash Table?
- 大家来说说大数据时代与真正跨平台应用,如何结合的更好
- JS Tab切换 选项卡 五种方法
- [bzoj]3295: [Cqoi2011]动态逆序对 主席树
- POJ-2262-Goldbach's Conjecture-2013-11-28 23:15:10
- 高效网站开发缓存技术应用——网页输出缓存(Ⅰ)
- Android实现推送方式解决方案
- Android NDK的include配置
- JAVA WEB项目の问题汇总
- POJ-3006-Dirichlet's Theorem on Arithmetic Progressions-2013-12-02 18:05:36
- html radio
- 【踩雷】android 中UI线程内调用gl指令的结果
- UML类图符号 各种关系说明以及举例