HDU 1397 Goldbach's Conjecture(素数打表)
来源:互联网 发布:mac用终端改时间 编辑:程序博客网 时间:2024/05/05 22:12
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1397
Problem Description
Goldbach's Conjecture: 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. 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.
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. 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 2^15. 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
Asia 1998, Tokyo (Japan)
题意:
给出一个n,找出两个素数a,b且a+b=n;问有多少对这样的素数!
代码如下:
#include <cstdio>int pri[40017];int main(){ for(int i = 2; i*i < 32768; i++) { if(!pri[i]) { for(int j = i; j*i < 32768; j++) { pri[j*i] = 1; } } } int n; while(scanf("%d",&n) && n) { int k = 0; for(int i = 2; i <= n/2; i++) { if(!pri[i] && !pri[n-i]) k++; } printf("%d\n",k); } return 0;}
1 0
- HDU 1397 Goldbach's Conjecture(素数打表)
- hdoj 1397 Goldbach's Conjecture (大数素数打表)
- HDU——1397Goldbach's Conjecture(二分查找+素数打表)
- HDU——1397Goldbach's Conjecture(二分查找+素数打表)
- Anti-Goldbach's Conjecture 素数打表
- LightOj 1259-Goldbach`s Conjecture(素数打表)
- Goldbach`s Conjecture (数论,素数打表)
- HDU 1397 Goldbach's Conjecture(素数判断)
- ZOJ 1951 Goldbach's Conjecture(素数打表)
- poj 2262 Goldbach's Conjecture -- 筛法求素数打表
- POJ 2262 Goldbach's Conjecture 素数打表
- HDU 1397 Goldbach's Conjecture
- hdu 1397 Goldbach's Conjecture
- hdu 1397 Goldbach's Conjecture
- hdu 1397 Goldbach's Conjecture
- HDU - 1397 Goldbach's Conjecture
- HDU 1397 Goldbach's Conjecture
- 【HDU】 1397 Goldbach's Conjecture
- Shell 命令--cut--总结自《Linux Shell 脚本攻略》
- size_t ssize_t loff_t 的区别
- centos安装ffmpeg
- linux下查找字符串&mysql-为magento性能测试修改innodb的innodb_buffer_pool_size而引发的问题
- Android 开发中java.lang.verifyerror问题
- HDU 1397 Goldbach's Conjecture(素数打表)
- java.lang.IllegalStateException: circular reference error Gson循环引用
- 黑马程序员—学习日记2概述
- 0-1背包问题(动态规划)
- Raft一致性协议
- Java中的Runnable、Callable、Future、FutureTask的区别与示例
- 中国餐饮管理系统的缺陷 针针见血
- LeetCode: Reverse Integer
- C++类型转换