poj2909
来源:互联网 发布:淘宝客服绩效考核标准 编辑:程序博客网 时间:2024/06/05 09:42
Description
For any even number n greater than or equal to 4, there exists at least one pair of prime numbers p1 and p2 such that
n = p1 + p2
This conjecture has not been proved nor refused yet. No one is sure whether this conjecture actually holds. However, one can find such a pair of prime numbers, if any, for a given even number. The problem here is to write a program that reports the number of all the pairs of prime numbers satisfying the condition in the conjecture for a given even number.
A sequence of even numbers is given as input. There can be many such numbers. Corresponding to each number, the program should output the number of pairs mentioned above. Notice that we are interested in the number of essentially different pairs and therefore you should not count (p1, p2) and (p2, p1) separately as two different pairs.
Input
An integer is given in each input line. You may assume that each integer is even, and is greater than or equal to 4 and less than 215. The end of the input is indicated by a number 0.
Output
Each output line should contain an integer number. No other characters should appear in the output.
Sample Input
610120
Sample Output
121
Source
#include<stdio.h>int is_prime(int x) {//判断一个数是否是素数 if (x == 2)//2是素数,直接返回1 return 1; int flag = 0; for (int i = 2; i * i <= x; i++) { if (!(x % i)) {//如果找到了该数的一个因子,那么这个数不是素数,标记后中断循环 flag = 1; break; } } if (flag)//如果找到了一个因子,说明这个数不是素数,返回0 return 0; return 1;//没有找到因子,这个数是素数,返回1}int main(void) { int n; while (scanf("%d", &n), n) { int count = 0; for (int i = 2; i <= n / 2; i++) { if (is_prime(i) && is_prime(n - i))//如果i和n-i都是素数,找到了一组满足哥德巴赫猜想的解,count的数量+1 count++; } printf("%d\n", count);//输出结果 } return 0;}
- poj2909
- poj2909
- poj2909
- POJ2909
- poj2909
- POJ2909:Goldbach's Conjecture
- POJ2909&&POJ1730基础数论
- poj2909 Goldbach's Conjecture
- 哥德巴赫猜想 POJ2909
- POJ2909 Goldbach's Conjecture
- poj2909 哥德巴赫猜想
- poj2909 0ms
- poj2909——Goldbach's Conjecture
- HDU1397 POJ2909 UVA686 UVALive5674 Goldbach's Conjecture(II)
- [算法学习]杨氏矩阵
- ARM在不同模式下如何区别同名寄存器(如fiq模式下的R8_fiq与其他模式下的R8),从而访问不同的寄存器
- 双向链表的快速排序
- UINavigationController与UITabBarController
- 灾难拯救——让软件项目重回轨道
- poj2909
- List<Map>的例子
- IOS 触屏多次敲击实例
- http://cdn.ac.nbutoj.com/Problem/view.xhtml?id=1003&&矩阵链乘
- HTML5,让 Ajax 改变 URL 且支持后退 - CodeCampo
- 调用C r e a t e *函数与调用O p e n *函数之间的主要差别
- 如果制作一个web项目安装部署包,并自动安装一些必备的组件?
- Linux使用回顾与补充
- oracle11g导出dmp导入到11g