数论基础(POJ2262)
来源:互联网 发布:手机淘宝订单生成器 编辑:程序博客网 时间:2024/06/13 11:56
Goldbach's Conjecture
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 45297 Accepted: 17255
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
拿到这一题,思路很清晰,开循环,同时判断判断自增数与差是否为素数。
于是就写了如下代码#include <stdio.h>#include <math.h>int isprime(int k){ int t=sqrt(k+0.5) ; for(int i=2; i<=t; i++) if(k%i==0) return 0; return 1;}int main(){ int n; while(scanf("%d",&n)!=EOF) { if(!n) return 0; int i; int t=n/2; for(i=3; i<=t; i+=2) if(isprime(i)&&isprime(n-i)) break; printf("%d = %d + %d\n",n,i,n-i) ; } return 0;}没有压力,一次AC。
0 0
- 数论基础(POJ2262)
- 【数论】poj2262 Goldbach's Conjecture
- POJ2262
- poj2262
- poj2262
- poj2262
- poj2262
- poj2262
- poj2262
- POJ2262
- poj2262
- poj2262
- POJ2262
- poj2262
- poj2262
- poj2262
- POJ2262
- Poj2262
- 蓝桥杯—剪邮票,对初学算法自己启发挺大的一题
- 走入“地图定位、导航”开发的世界
- 027引用同级的元素
- 让web应用被外界访问的三种方式:
- HDU 1325 Is It A Tree?
- 数论基础(POJ2262)
- The Double HeLiX
- leetcode题解-268. Missing Number
- 京东实习笔试——终结者C
- Map<String, Double>实现对value的降序排序
- 自定义广播
- Scala学习--Trait
- 滑动门
- (2017/4、8、/ B