HDU 1397
题意:给你一个结论,要你证明:n = p1 + p2..
#include<iostream>
using namespace std;#define manx 40000
bool s[manx];
void prime(){
for(int i=0;i<=manx;i++)
s[i]=0;
for(int i=2;i<=600;i++){
if(!s[i]){
for(int j=2; j*i<=32770;j++){
s[i*j]=1;
}
}
}
}
int main(){
int n;
prime();
while(cin>>n,n){
int sum=0;
for(int i=2;i<=n/2;i++){
if(!s[i] && !s[n-i]) sum++;
}
cout<<sum<<endl;
}
}
POJ 2267没什么说的...
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define manx 1000010
bool s[manx];
int p[manx],num;
void prim(){
//memset(s,0,sizeof(s));
for(int i=0;i<manx;i++) s[i]=0;
for(int i=2;i*i<manx;i++){
if(!s[i]){
for(int j=2;j*i<manx;j++){
s[i*j]=1;
}
}
}
num=0;
for(int i=2;i<manx;i++)
if(!s[i]) p[num++]=i;
s[0]=s[1]=1;
}
int main(){
int n;
prim();
while(scanf("%d",&n),n){
int flag=0;
for(int i=0;p[i]<=n && i<num;i++){
if(!s[n-p[i]]) {
printf("%d = %d + %d\n",n,p[i],n-p[i]);
flag=1;
break;
}
}
if(!flag) printf("Goldbach's conjecture is wrong.\n");
}
}