HDU1397
Problem Description
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
6 10 12 0
Sample Output
1 2 1 题目大意:给一个大于或等于四的偶数n,判断从2到32767间存在几组任意两个素数相加等于n的素数对。 解题思路:用素数筛选法,把是素数的赋值为1,不是的赋值为0; 只需判断从2到n/2间的素数即可,否则会出现重复,导致超时。 代码: #include<iostream> #include<stdlib.h> #include<stdio.h> #include<cmath> #include<algorithm> #include<string> #include<string.h> using namespace std; int prime[1000000]; void sushushaixuan() { //素数筛选法 int i, j; memset(prime, 1, sizeof(prime)); //将数组prime[]里的值全赋为1 for (i = 2; i <= 500000; i++) { if (prime[i]) { for (j = i + i; j < 1000000; j += i) prime[j] = 0; //如果不是素数,赋值为0 } } } int main() { int n; while (scanf("%d", &n) != EOF&&n) { int c=0; sushushaixuan(); for (int i = 2; i <= n / 2; i++) { if (prime[i]==1 && prime[n - i]==1) //如果都是素数,则c增一 c++; } printf("%d\n", c); } return 0; }