素数判断
来源:互联网 发布:手机淘宝怎么找小二 编辑:程序博客网 时间:2024/05/19 02:18
B - Goldbach's Conjecture
POJ - 2262
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.
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.
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."
820420
8 = 3 + 520 = 3 + 1742 = 5 + 37
题意:给一个数,求2个差最大的
代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int pa(int n){for(int i=2;i<=sqrt(n);i++)if(n%i==0)return 0;return 1;}int main(){int n;while(cin>>n,n){int flag=0;int m;for(int i=2;i<=n/2;i++){m=n-i;if(pa(i)&&pa(m)){flag=i;break;}}if(flag)cout<<n<<" = "<<flag<<" + "<<m<<endl;elsecout<<"Goldbach's conjecture is wrong."<<endl;}return 0;}
0 0
- 素数判断
- 判断素数
- 判断素数
- 判断素数
- 素数判断
- 判断素数
- 判断素数
- 判断素数
- 判断素数
- 判断素数
- 判断素数
- 素数判断
- 判断素数
- 判断素数
- 判断素数
- 判断素数
- 判断素数
- 判断素数
- 工作流引擎Activiti学习第一天(一)环境搭建
- DP——Arithmetic Slices
- 学习淘淘商城第五十九课(ActiveMQ持久化Topic消息)
- C++ Primer 第5版--练习10.34
- iOS小技巧纪录(持续更新)
- 素数判断
- 566. Reshape the Matrix
- Java内存区域与内存溢出异常
- python:异常
- AVL树的构建
- PAT 乙级 1029. 旧键盘(20)
- C++ Primer 第5版--练习10.35
- 网站最下方的版权信息源代码仅供参考
- Spring——${}和#{}