poj 2909 Goldbach's Conjecture (哥德巴赫猜想)
2015-08-22 14:43
615 查看
Goldbach's Conjecture
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
Sample Output
Source
水题
写一遍的目的是。。。复习一下快速筛的写法 喵呜
View Code
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 10364 | Accepted: 6143 |
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
6 10 12 0
Sample Output
1 2 1
Source
水题
写一遍的目的是。。。复习一下快速筛的写法 喵呜
/************************************************************************* > File Name: code/poj/2909.cpp > Author: 111qqz > Email: rkz2013@126.com > Created Time: 2015年08月22日 星期六 14时25分34秒 ************************************************************************/ #include<iostream> #include<iomanip> #include<cstdio> #include<algorithm> #include<cmath> #include<cstring> #include<string> #include<map> #include<set> #include<queue> #include<vector> #include<stack> #define y0 abc111qqz #define y1 hust111qqz #define yn hez111qqz #define j1 cute111qqz #define tm crazy111qqz #define lr dying111qqz using namespace std; #define REP(i, n) for (int i=0;i<int(n);++i) typedef long long LL; typedef unsigned long long ULL; const int inf = 0x3f3f3f3f; const int N=1<<16; bool not_prime ; int prime ; int prime_num; int n; void init(){ not_prime[0] = true; not_prime[1] = true; for ( int i =2 ; i < N ; i++){ if (!not_prime[i]){ prime[++prime_num] = i; } for ( int j = 1 ; j <= prime_num&&i*prime[j]<N ; j++){ not_prime[i*prime[j]] = true; if (i%prime[j]==0) break; } } } int main() { init(); int n ; while (scanf("%d",&n)&&n){ int ans = 0 ; for ( int i = 2 ; i <= n /2 ; i++){ if (!not_prime[i]&&!not_prime[n-i]){ ans++; } } printf("%d\n",ans); } return 0; }
View Code
相关文章推荐
- pymongo中的连接操作:Connection()与MongoClient()
- Good Bye 2014 C. New Year Book Reading 贪心
- Good Bye 2014 B. New Year Permutation 并查集 最短路 floyed算法
- 基于Google Material Design设计开发,模块包括图片浏览,视频爽看 ,音乐轻听以及二维码扫描
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon
- Go 1.5中值得关注的几个变化
- 投资问题,lingo程序
- Go 的垃圾回收机制在实践中有哪些需要注意的地方?
- Go语言教程汇总
- Go语言中使用panic和recover简化错误处理
- Go获取命令行参数及信号量处理
- Go各种类型转换及函数的高级用法
- Go语言中的复合类型及面向对象思想
- HDU 2521 反素数
- oc NSDate / Category类目 / 延展
- Algorithm类介绍(core)
- NYOJ 546 Divideing Jewels ( 背包+二进制优化)
- UVA 11090 Going in Cycle!! SPFA判断负环+二分
- window7安装django
- Go语言相关图书推荐