ZOJ.1951 Goldbach's Conjecture【素数】 2015/09/22
来源:互联网 发布:cf手游不掉血软件 编辑:程序博客网 时间:2024/05/21 17:51
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
Source: University of Ulm Local Contest 1998
将一个数分解成两个素数相加,若有多解,则输出两解差值最大的一组
#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;}
- ZOJ.1951 Goldbach's Conjecture【素数】 2015/09/22
- Poj.2262 Goldbach's Conjecture【素数】 2015/09/22
- ZOJ 1951 Goldbach's Conjecture(素数打表)
- POJ 2262/ ZOJ 1951:Goldbach\'s Conjecture - 筛法打素数表
- zoj 1951 Goldbach's Conjecture(素数筛选继续水)
- zoj 1951 Goldbach's Conjecture
- zoj 1951 Goldbach's Conjecture
- zoj 1951 Goldbach's Conjecture (水``)
- zoj--1951 Goldbach's Conjecture(math)
- POJ 2909 / ZOJ 1657 : Goldbach\'s Conjecture - 筛法打素数表
- Goldbach`s Conjecture 素数筛选
- zoj 1657 Goldbach's Conjecture
- zoj 1951 || poj 2262 Goldbach's Conjecture(水水~)
- HDOJ 1397 Goldbach's Conjecture [爱沙托散筛法求素数]
- POJ 2262 Goldbach's Conjecture(素数表)
- POJ 2909 Goldbach's Conjecture(素数表)
- PKU2262 Goldbach's Conjecture 数论-素数
- Goldbach's Conjecture map+素数表
- 多种方案解决*** Assertion failure in -[UIApplication _runWithMainScene:transitionContext:completion:]
- JSONObject简介
- 大众点评2016校招总结和面经
- React 入门实例教程总结
- Java 注解
- ZOJ.1951 Goldbach's Conjecture【素数】 2015/09/22
- jquery Select2 学习笔记之中文提示
- Spring AspectJ AOP 完整示例
- JS(去掉前后空格或去掉所有空格)的用法
- instanceof和 Class.isInstance
- SVG精髓(第2版)——互动出版网
- nodeJs socketJs 搭建长连接(1) 基础讲解
- Linux FTP 服务器中将用户限制在自己目录下的方法
- Android开发教程13:UI之列表:ListView