Poj.2262 Goldbach's Conjecture【素数】 2015/09/22
来源:互联网 发布:excel怎么查重复数据 编辑:程序博客网 时间:2024/05/22 06:35
Goldbach's Conjecture
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41186 Accepted: 15776
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
同ZOJ1951
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;bool prime[1000010];void init(){ memset(prime,false,sizeof(prime)); for( int i = 2 ; i <= 1000000 ; ++i ){ if( !prime[i] ){ for( int j = i+i ; j <= 1000000 ; j+=i ) prime[j] = true; } }}int main(){ init(); int n; while( cin>>n ){ if( !n ) break; for( int i = 2 ; i <= n/2 ; ++i ){ if( !prime[i] && !prime[n-i] ){ printf("%d = %d + %d\n",n,i,n-i); break; } } } return 0;}
0 0
- Poj.2262 Goldbach's Conjecture【素数】 2015/09/22
- 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(素数)
- ZOJ.1951 Goldbach's Conjecture【素数】 2015/09/22
- POJ 2262 Goldbach's Conjecture ( 筛选法求素数 )
- POJ 2262/ ZOJ 1951: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 简单的素数
- Linux FTP 服务器中将用户限制在自己目录下的方法
- Android开发教程13:UI之列表:ListView
- CentOS安装gdb 7.6.1教程
- 数学-爬虫
- linux 下如何给一个普通用户有在指定目录下有创建文件的权限
- Poj.2262 Goldbach's Conjecture【素数】 2015/09/22
- Android samples API Demos之UI篇1(ActionBarCompat-Basic)
- HTTP 协议详解
- Apache2.4+php5.6+Mysql5.6+Mantisbt 配置
- String、StringBuffer与StringBuilder的区别
- 9月29日An Introduction to MeteorJS
- noip2008 立体图 (字符串+模拟)
- 升级Xcode7+后遇到的问题
- 更改CentOS 6.5 yum源