UVa 686 Goldbach's Conjecture (II) (哥德巴赫猜想)
2013-10-05 11:55
381 查看
686 - Goldbach's Conjecture (II)
Time limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=627
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.
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
同这一题。
完整代码:
/*0.015s*/ #include<cstdio> #include<cmath> const int maxn = 1 << 15; const int m = (int)sqrt(maxn); bool vis[maxn]; inline void cal_prime() { int i, j; for (i = 2; i <= m; ++i) if (!vis[i]) for (j = i * i; j < maxn; j += i) vis[j] = true; } int main() { cal_prime(); int n, m, i, count; while (scanf("%d", &n), n) { count = 0, m = n >> 1; for (i = 2; i <= m; ++i) if (!vis[i] && !vis[n - i]) ++count; printf("%d\n", count); } return 0; }
相关文章推荐
- UVa 543 Goldbach's Conjecture (素数&哥德巴赫猜想)
- The Go Programming Language Specification
- 2013 MPD SZ会议小结及书评 - How Google Test Software
- Map-Reduce Algorithm Design
- 算法学习 - Dijkstra's Algorithm
- [POJ][1003]Hangover
- Manacher's ALGORITHM
- 匈牙利算法Hungarian algorithm
- single number
- hdu 2401 Baskets of Gold Coins
- 解决google服务框架、google play、google地图、google搜索等基本的应用无使用最简单的方法
- 安装google+时提醒手机中没有该应用所需的共享库的解决方法
- The rsync algorithm
- Google发布Chrome 30:支持图片搜索及安卓端的一些新手势
- LOGO中的隐含信息
- Google发布Chrome 30:支持图片搜索及安卓端的一些新手势
- Single Number II
- spoj AMR11 Robbing Gringotts 双边暴力+hash+费用流
- Google's BigTable 原理
- UVa 11292 Dragon of Loowater