POJ 2909
来源:互联网 发布:巴比馒头 知乎 编辑:程序博客网 时间:2024/05/19 16:04
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
610120
Sample Output
121
Source
//tju 1859 (tju1171-2262poj)//poj 2909#include<iostream>#include<math.h> #define MAX 32768using namespace std;int Primer[MAX]; bool isPrimer(int n){ int i = 0; for(i = 3; i <= sqrt((long double)n);i = i+2){ if(n%i == 0) return false; } return true;} int BiSearch(int key,int length){ int lo = 0, hi = length-1; int mid = (lo + hi)/2; while(lo<=hi){ mid = (lo + hi)/2; if(key < Primer[mid]){ hi = mid -1; //cout<<"less"<<endl; //cout<<Primer[mid]<<endl; continue; } else if(key > Primer[mid]) { lo = mid +1; //cout<<"larger"<<endl; continue; } else return mid; } return mid;}int main(){ int n=0; Primer[0] =2; int i,pi = 1; for(i=3;i<MAX;i=i+2) { if(isPrimer(i)){ Primer[pi]=i; //cout<<i<<endl; pi++; } //if(i>10) // break; } //cout<<Primer[1257]<<endl; //cout<<BiSearch(2,5)<<endl; //cout<<pi<<endl; while(cin>>n){ if(n==0) break; int pairs = 0; int p_smaller = 0; int smaller = 0; int p_bigger = 0; int bigger = 0; //cout<<pi<<n<<endl; int MaxSearcherNum = BiSearch(n,pi+1); //cout<<MaxSearcherNum<<endl; for(p_smaller = 0;p_smaller<MaxSearcherNum/2+1;p_smaller++){ //cout<<"p_smaller = "<< p_smaller<< endl; smaller = Primer[p_smaller]; bigger = n - smaller; //cout<<BiSearch(bigger,MaxSearcherNum)<<endl; if(Primer[BiSearch(bigger,MaxSearcherNum)]==bigger){ //cout<<n<<" = "<<smaller<<" + "<< bigger<<endl; pairs ++; } } cout<< pairs <<endl; } system("pause"); return 0;}
//tju 1859 (tju1171-2262poj)//poj 2909#include<iostream>#include<math.h> #define MAX 32768using namespace std;int Primer[MAX]; bool isPrimer(int n){ int i = 0; for(i = 3; i <= sqrt((long double)n);i = i+2){ if(n%i == 0) return false; } return true;} int BiSearch(int key,int length){ int lo = 0, hi = length-1; int mid = (lo + hi)/2; while(lo<=hi){ mid = (lo + hi)/2; if(key < Primer[mid]){ hi = mid -1; //cout<<"less"<<endl; //cout<<Primer[mid]<<endl; continue; } else if(key > Primer[mid]) { lo = mid +1; //cout<<"larger"<<endl; continue; } else return mid; } return mid;}int main(){ int n; while(cin>>n){ if(n==0) break; int i = 0; int pairs = 0; //cout<<pairs<<endl; for(i=3;i<n/2+1;i=i+2){ int temp = n - i; if(isPrimer(temp)&&isPrimer(i)){ //cout<< temp<<" "<<i<<endl; pairs++; } } cout<<pairs<<endl; } return 0;}
#include <iostream>#include <math.h>#include <string.h>using namespace std;int main(){int N;bool isprim[33000];memset(isprim, 1, 33000);int temq = (int)sqrt((double)(33000));for(int i = 2; i <= temq; i++){if(isprim[i] == false)continue;for(int j = i * i; j < 33000; j += i){isprim[j] = false;}}isprim[0] = isprim[1] = isprim[2] = false;//for(int i = 3; i < 33; i++)//{//if(isprim[i] == true)//{//cout<<i<<endl;//}//}while(cin>>N){if(N == 0)break;int hN = N /2;int total = 0;for(int i = 3; i <= hN; i++ ){if(isprim[i] == true){if(isprim[N - i] == true){total++;}}}cout<<total<<endl;}return 0;}
- POJ 2909
- POJ-2909
- poj 2909
- POJ 2909 哥德巴赫猜想
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- winpcap截获HTTP代码
- 如何屏蔽开始菜单
- 读 当世界无法改变时改变自己
- 第四讲:Obj-C 内存管理2 - retain / copy
- Data Guard 之表误操作恢复
- POJ 2909
- 2013年03月07日 工作总结
- eclipse导入jdk_src
- openCV中IplImage的使用(转载)
- 第五讲:Obj-C 内存管理3 - 自定义MyArray
- 拥抱变化——持续集成(CI)实践心得
- webwork和ibatis分页
- 绝对正确绝对全的TCHAR和char的转换以及字符编码转换
- (转)引爆2013年互联网格局的十大趋势