HDU - 1397 Goldbach's Conjecture
2015-03-29 02:46
316 查看
Goldbach's Conjecture
Submit Status
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.
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
Sample Output
Time Limit: 1000MS | Memory Limit: 32768KB | 64bit IO Format: %I64d & %I64u |
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.
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
6 10 12 0
Sample Output
1 2 1
#include<iostream> #include<vector> //首先筛出素数,用vis标记每个数是不是素数,然后对于询问就for一遍看下每种拆分是不是两个都是素数。 using namespace std; const int MAXN = 1000000; //注意要开的够大 int vis[MAXN]; void Prime() //素数筛 { vis[0] = 1; vis[1] = 1; for (long long int i = 2; i*i <= MAXN; i++) { if (!vis[i]) { for (long long int j = i+i; j <= MAXN; j = j + i) vis[j] = 1; } } return; } int main() { Prime(); long long int n; while (cin >> n&&n) { long long int sum = 0; for (long long int i = 2; i <=n/2; i++) { if (!vis[i] && !vis[n - i]) sum++; } cout << sum << endl; } }
相关文章推荐
- POJ 2909 && 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(素数打表)
- HDOJ 1397:Goldbach's Conjecture 哈希加筛选法求素数
- 杭电 HDU ACM 1397 Goldbach's Conjecture
- HDOJ 1397 Goldbach's Conjecture(快速筛选素数法)
- HDOJ-1397-Goldbach's Conjecture 解题报告
- hdu Goldbach's Conjecture
- hdoj 1397 Goldbach's Conjecture (大数素数打表)
- HDOJ 1397 Goldbach's Conjecture [爱沙托散筛法求素数]
- POJ 2262 Goldbach's Conjecture(素数表)
- POJ 2262 Goldbach's Conjecture [暴力]
- zoj 1657 || poj 2262 Goldbach's Conjecture
- Goldbach's Conjecture
- xt 1140 Anti-Goldbach's Conjecture
- POJ-2262 Goldbach's Conjecture 解题报告(数论) 哥德巴赫的猜想
- POJ 2262 Goldbach's Conjecture 哥德巴赫猜想