POJ-2262

#include<stdio.h>
#include<math.h>
int prime(long num)
{
    long i;
    long temp = sqrt(num);
    for (i = 2; i <= temp; i++)
        if (num%i == 0) break;
    if (i > temp)
       return 1;
    else
        return 0;
}

int addup(long num)
{
    long i, j;
    for (i=3, j=num-i; i <= j; i+=2) {        
        if (!prime(i)) continue;
        j=num-i;
        if (!prime(j)) continue;
        printf("%ld = %ld + %ld\n", num, i, j);
        return 1;
    }
    printf(" Goldbach's conjecture is wrong.\n");
    return 0;     
}
main()
{
      long num;
      
      while (scanf("%ld", &num), num) {
          addup(num);            
      }
}