#includeint prime(int m);int main(){ int i,j,k,count=0; for(i=6;i<=100;i+=2) {for(j=3;j<=i/2;j++){if((j)&&(i-j)){ printf("%d=%d+%d\t",i,j,i-j); count++; if(count==5) { printf("\n"); count=0; } break;}} } return 0;} int prime(int m) { int i; for(i=2;i<=m-1;i++) { if(m%i==0) return 0; } return 1; },源程序如下: #include "stdio.h" #include "math.h" int ss(int x) { int t; for(t=2;twww.mh456.com防采集。
#coding=utf-8import sys,timefrom math import sqrtdef isprime(num): for i in range(2,int(sqrt(num))+1): if num%i==0: return False return True def gedebahe(num): for i in range(2,num//2+1): if isprime(i) and isprime(num-i): return True return Falsesedef main(n): for i in range(6,n+1,2): if not gedebahe