poj2262

#include "stdafx.h"#include <stdio.h>#include <math.h>

int prime(int n){ int i; if(n == 1)  return 0; if(n == 2)  return 1; for(i=2;i<=(int)sqrt(n);i++)  if(n % i == 0)   return 0;  return 1;}

void process(int n){ int i,j; int savei,savej; for(i=2;i<=n/2;i++) {   if(prime(i) ==1 && prime(n-i) == 1 )    {     savei = i;     savej = n-i;     break;  //无须设MAX比较，最先的肯定最小   } }

 printf("%d = %d + %d/n",n,savei,savej);

}

 

int main(){ int n; scanf("%d",&n);

 while(n != 0) {  process(n);  scanf("%d",&n); }

 return 0;}