UVa 543 - Goldvach's Conjecture

	/**
	* Author : Md.Mehadi Hasan Menon.
	* Problem : 543 - Goldvach's Conjecture .
	* Status : Accepted.
	* Date : 07-10-2014.
	**/
	#include <stdio.h>
	int isPrime(int n);
	int main()
	{
	int i, n, found;
	while(scanf("%d", &n) && n != 0)
	{
	found = 0;
	for(i = 3; i <= n; i++)
	{
	if(isPrime(i) && isPrime(n - i))
	{
	printf("%d = %d + %d\n", n, i, n - i);
	found = 1;
	break;
	}
	}
	if(!found)
	{
	printf("Goldbach's conjecture is wrong.\n");
	}
	}
	return 0;
	}
	int isPrime(int n)
	{
	int i;
	for(i = 2; i * i <= n; i++)
	{
	if(n % i == 0)
	{
	return 0;
	}
	}
	return 1;
	}

view raw 543.cpp hosted with ❤ by GitHub