1397 Goldbach's Conjecture
来源:互联网 发布:上证综合指数月度数据 编辑:程序博客网 时间:2024/06/07 04:41
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.
610120
121
疯狂打表
#include<stdio.h>int main(){ int n, i, j, k=0, m, count; int prime[100000], a[1000000]; for(i=2;i<1000000;i++) { if(a[i]==0) { prime[k++]=i; for(j=i*2;j<1000000;j+=i) a[j]=1; a[i]=2; } } while(scanf("%d", &n)!=EOF&&n) { count = 0; for(i=0;prime[i]<=n/2;i++) { m=n-prime[i]; if(a[m]==2) count++; } printf("%d\n", count); } return 0;}
阅读全文
0 0
- 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
- 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
- HDOJ 1397 Goldbach's Conjecture [爱沙托散筛法求素数]
- hdoj.1397 Goldbach's Conjecture 20140825
- HDOJ-1397-Goldbach's Conjecture 解题报告
- Goldbach's Conjecture
- poj2262 Goldbach's Conjecture
- Goldbach's Conjecture
- Goldbach's Conjecture
- ajax是什么? ajax的交互模型? 同步和异步的区别? 如何解决跨域问题?
- ZOJ 3993(2017CCPC秦皇岛站M题)Safest Buildings
- 简单计算器
- SurfaceView 实现动态曲线
- HDU 4283 You Are the One(区间DP)
- 1397 Goldbach's Conjecture
- c语言 rand()和srand()函数用法
- ubuntu 升级后无法连接wifi问题(Wireless 8265 / 8275网卡)
- 中文与url编码转换
- java-12-thread
- Android 搜索不到蓝牙设备
- How Big Is A Petabyte, Exabyte, Zettabyte, Or A Yottabyte?(COPY)
- PTA| 根据后序和中序遍历输出先序遍历(25 分)
- IE浏览器无法加载数据,按F12就可以加载