算法笔记-问题 C: Goldbach‘s Conjecture
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了算法笔记-问题 C: Goldbach‘s Conjecture,小编现在分享给大家,供广大互联网技能从业者学习和参考。文章包含1765字,纯文字阅读大概需要3分钟。
内容图文
![算法笔记-问题 C: Goldbach‘s Conjecture](/upload/InfoBanner/zyjiaocheng/611/7cba6d0e22c24def924e6f77ecaee630.jpg)
问题 C: Goldbach's Conjecture
题目描述
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.
样例输入 Copy
4 10 16 0
样例输出 Copy
1 2 2
代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000000;
int prime[maxn], num = 0;
bool p[maxn] = {0};
bool isPrime(int n){
if(n<=1) return false;
int sqr = (int)sqrt(1.0*n);
for(int i=2; i<=sqr; i++){
if(n%i==0) return false;
}
return true;
}
void Find_Prime(){
for(int i=2; i<maxn; i++){
if(p[i] == false){
prime[num++] = i;
for(int j=i+i; j<maxn; j+=i)
p[j] = true;
}
}
}
int main() {
Find_Prime();
int n;
while(scanf("%d", &n)!=EOF){
if(n==0) break;
int i=0, cont = 0;
while(prime[i]<=n/2){
if(isPrime(n-prime[i])){
cont++;
}
i++;
}
printf("%d\n", cont);
}
return 0;
}
内容总结
以上是互联网集市为您收集整理的算法笔记-问题 C: Goldbach‘s Conjecture全部内容,希望文章能够帮你解决算法笔记-问题 C: Goldbach‘s Conjecture所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错,欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 gblab@vip.qq.com 举报,一经查实,本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。