POJ 2262 Goldbach's Conjecture
2014-04-08 20:51
225 查看
#include<stdio.h> int phi[1000010]; int prime[100000],len; int euler() { int i,j; len=0; for(i=0;i<1000010;i++) phi[i]=0; for(i=2;i<1000010;i++) { if(!phi[i]) for(j=i+i;j<1000010;j+=i) { phi[j]=1; } if(phi[i]==0) prime[len++]=i; } /*printf("len=%d\n",len); for(i=0;i<len;i++) { getchar(); printf("%d\n",prime[i]); }*/ } int main() { int n,i; euler(); while(scanf("%d",&n),n) { for(i=0;i<len&&prime[i]<n;i++) { if(!phi[n-prime[i]]) { printf("%d = %d + %d\n",n,prime[i],n-prime[i]); break; } } } return 0; }
View Code
相关文章推荐
- POJ 2262 Goldbach's Conjecture (素数判断)
- POJ 2262 Goldbach's Conjecture(Eratosthenes筛法)
- poj 2262 Goldbach's Conjecture【质数和】
- POJ 2262 Goldbach's Conjecture
- poj 2262 Goldbach's Conjecture
- poj 2262 Goldbach's Conjecture
- Poj 2262 / OpenJudge 2262 Goldbach's Conjecture
- POJ 2262:Goldbach's Conjecture
- poj 2262 Goldbach's Conjecture 素数 水题
- POJ2262-Goldbach's Conjecture
- 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 数学常识 难度:0
- poj 2262 Goldbach's Conjecture(素数筛选法)
- poj-2262-Goldbach's Conjecture
- POJ 2909 Goldbach's Conjecture