poj 2262
2011-10-25 18:40
190 查看
poj 2262
#include<iostream>#include<fstream>#include<algorithm>#include<time.h>using namespace std;/*unsigned __int64 getClock(){__asm{rdtsc;}}*/int main( ){freopen("input.txt","r",stdin);ofstream cout("output.txt");const int NUM=1000010;int *prime=new int[NUM];for(int i=0;i<NUM;i++){prime[i]=1;}for(int i=2;i<NUM;i++){for(int j=2;i*j<NUM;j++){prime[i*j]=0;}}int n;while(scanf("%d",&n)!=EOF){if(prime>1){cout<<n<<" = "<<prime<<" + "<<n-prime<<endl;continue;}int temp=n/2;for(int i=3;i<=temp;i+=2){if(prime[i]==1&&prime[n-i]==1){prime=i;cout<<n<<" = "<<i<<" + "<<n-i<<endl;break;}}}return 0;}
相关文章推荐
- Goldbach's Conjecture_POJ 2262
- 【poj 2262】 Goldbach's Conjecture
- POJ 2262 Goldbach's Conjecture 素数打表
- POJ2262(解题报告)
- poj2262
- 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 笔记
- POJ2262 素数判定,万能的素数筛选
- POJ 2262 Goldbach's Conjecture (打表)
- POJ_2262
- POJ-2262-Goldbach's Conjecture-2013-11-28 23:15:10
- POJ 2262 (简单素数判定 ,需要优化)
- POJ2262 素数筛法
- POJ 2262
- POJ 2262 Goldbach's Conjecture
- poj 2262 打表