#include<stdio.h>
int prime(int k){
	int flag=1;
	int j;
	for(j=2;j<=k/2;j++){
			if(k%j==0){
				flag=0;
			break;
	}
	}
				return flag;
			}
int main(){
int i,n,f=0;
	for(scanf("%d",&n);n!=0;scanf("%d",&n)){
		for(i=3;i<=n/2;i=i+2){
			if(prime(i)&&prime(n-i)){
		printf("%d = %d + %d\n",n,i,n-i);
		f=1;
		break;
			}
		}
		if(!f)
			printf("Goldbach's conjecture is wrong.\n");
			}
return (0);
}

• Re:帮忙看下怎么会超时呢 (478) zhuangzebo 2011-04-14 13:32:33
  • Re:帮忙看下怎么会超时呢 (461) zhuangzebo 2011-04-14 13:34:47
• 判断素数到k<=sqrt(n)；这样快些吧，k/2还是大了···不过我到sqrt(n)，用了700多MS，汗 (0) songzhenqi 2011-07-25 10:46:40