poj_2262 Goldbach's Conjecture
2013-05-22 18:02
411 查看
题目链接:http://poj.org/problem?id=2262
//C++代码 #include<iostream> using namespace std; bool a[1000001]; int p[300001]; void prim(){ //素数筛法,筛出1-1000000里的素数 int i,j,num=0; for(i=0;i<=1000000;i++) a[i]=true; for(i=2;i*i<=1000000;i++){ if(a[i]){ j=i+i; while(j<=1000000){ a[j]=false; j+=i; } } } for(i=2;i<=1000000;i++){ if(a[i]) p[num++]=i; } } int main(){ prim(); int n; while(cin>>n,n){ for(int i=0;;i++){ if(a[n-p[i]]){ cout<<n<<" = "<<p[i]<<" + "<<n-p[i]<<endl; break; } } } return 0; }
相关文章推荐
- poj2262 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture(素数表分解质数)
- POJ-2262 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture 哥德巴赫猜想
- poj 2262 Goldbach's Conjecture 素数筛
- POJ 2262 Goldbach's Conjecture [暴力]
- POJ 2262 Goldbach's Conjecture
- poj-2262-Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture(素数表)
- POJ 2262 Goldbach's Conjecture 简单的素数
- POJ 2262 Goldbach's Conjecture
- poj 2262 Goldbach's Conjecture 【素数筛法】
- poj 2262 Goldbach's Conjecture 【素数筛】
- POJ 2262 / UVa 543 - Goldbach's Conjecture (哥德巴赫猜想)
- POJ 2262 Goldbach's Conjecture(素数)
- POJ 2262 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture (水题)
- POJ 刷题系列:2262. Goldbach's Conjecture
- poj-2262 Goldbach's Conjecture