POJ 2262 Goldbach's Conjecture(素数表分解质数)
来源:互联网 发布:野蛮人升级数据 编辑:程序博客网 时间:2024/06/02 07:20
Goldbach's Conjecture
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41314 Accepted: 15827
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将一个数分解为两个素数相加,且差值最大的那一个,因为数据范围为100w,所以直接打一个素数表就行了。ac代码:#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>#define MAXN 1000100#define INF 0xfffffff#define MIN(a,b) a>b?b:ausing namespace std;int v[MAXN];void db(){int i,j;memset(v,0,sizeof(v));for(i=2;i<=1000000;i++){if(v[i]==0){for(j=i*2;j<=1000000;j+=i)v[j]=1;}}}int main(){db();int num;int i;while(scanf("%d",&num)&&num){int bz=0;for(i=2;i<num;i++){if(!v[i]&&!v[num-i]){printf("%d = %d + %d\n",num,i,num-i);bz=1;break;}}if(bz==0)printf("Goldbach's conjecture is wrong.\n");}return 0;}
0 0
- 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 2909 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【素数】 2015/09/22
- POJ 2262 Goldbach's Conjecture 简单的素数
- 离散化泛做
- 被忽视的预处理命令
- iOS 键盘通知 与 键盘上方工具条设置
- 【DWR】学习笔记(一):基本配置&&前后台的数据传输与处理
- LeetCode 6: ZigZag Conversion
- POJ 2262 Goldbach's Conjecture(素数表分解质数)
- HDU——2087 剪花布条
- Linux初始root密码设置
- 第七周-自制迷宫升级版
- 深入Java集合:HashMap的实现原理
- 【图论】spoj two famous companies
- Java中的关键字
- <草稿>Mac下配置JDK,Tomcat,Eclipse
- 第四周--项目5猴子选大王