九度 题目1440:Goldbach's Conjecture
来源:互联网 发布:铸造行业 利润 知乎 编辑:程序博客网 时间:2024/06/09 22:53
九度 题目1440:Goldbach’s Conjecture
原题OJ链接:http://ac.jobdu.com/problem.php?pid=1440
题目描述:
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.
输入:
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.
输出:
Each output line should contain an integer number. No other characters should appear in the output.
样例输入:
610120
样例输出:
121
源代码:
#include<iostream>#include<cstring>using namespace std;const int MAX_N=1<<15; bool mask[MAX_N+1];int prime[MAX_N];int primeSize;int init(){ memset(mask,0,sizeof(mask)); primeSize=0; for(int i=2;i<=MAX_N;i++){ if(mask[i]==true) continue; else prime[primeSize++]=i; for(int j=2*i;j<=MAX_N;j=j+i){ mask[j]=true; } } }int main(){ int n; int p1,p2; init(); while(cin>>n && n!=0){ int count=0; int i=0; while(prime[i]<=n/2){ p1=prime[i]; p2=n-prime[i]; if(mask[p2]==false) count++; i++; } cout<<count<<endl; } return 0;}
- 九度题目1440Goldbach's Conjecture
- 九度 题目1440:Goldbach's Conjecture
- 九度题目1440:Goldbach's Conjecture
- 【九度】题目1440:Goldbach's Conjecture 2
- 九度OJ题目1440:Goldbach's Conjecture
- 题目1440:Goldbach's Conjecture 九度OJ
- 九度OJ-1440:Goldbach's Conjecture
- 题目1440:Goldbach's Conjecture
- 题目1440:Goldbach's Conjecture
- 题目1440:Goldbach's Conjecture
- 题目1440:Goldbach's Conjecture
- 53-题目1440:Goldbach's Conjecture
- 题目1440:Goldbach's Conjecture
- 题目53:Goldbach's Conjecture
- Goldbach's Conjecture
- poj2262 Goldbach's Conjecture
- Goldbach's Conjecture
- Goldbach's Conjecture
- 完美解决UITextField输入时文字往下偏移的问题
- 在服务器建立jupyter,浏览器内运行python程序
- Spark2.1特征处理:提取/转换/选择
- ReactNative学习第四天 WebStorm安装及项目顶部效果
- 51Nod 1130 N的阶乘的长度 V2(斯特林近似)
- 九度 题目1440:Goldbach's Conjecture
- JNI NDK (AndroidStudio+CMake )实现Java调用C C++代码流程
- 整理CSS3的transform属性
- 解决Error:java: System Java Compiler was not found in classpath
- Java访问修饰符
- webRTC学习资料
- tcp 服务端
- GitLab 极简安装
- Maven POM.xml标签详解