UVA 543 - Goldbach's Conjecture

#include <bits/stdc++.h>
using namespace std;
long long int prime(int a)
{
    int p,q,f=1;
    for(p=2;p<=sqrt(a);p++)
    {
        if(a%p==0)
        {
            f=0;
        }

    }
    return f;

}
int main()
{
    long long int n,i,j;
    while(cin>>n)
    {
        i=3;
        if(n==0)
        {
            break;
        }

            while(i<n)
            {
                j=n-i;
                if(prime(i) && prime(j))
                {
                   printf("%lld = %lld + %lld\n",n,i,j);
                   break;

                }
                i=i+2;


            }
            if(i>n)
            {
                printf("Goldbach's conjecture is wrong.\n");
            }





    }
    return 0;
}

Download Coding Interview Book and Get More Tutorials for Coding and Interview Solution: Click Here

Download System Design Interview Book and Get More Tutorials and Interview Solution: Click Here

Do you need more Guidance or Help? Then Book 1:1 Quick Call with Me: Click Here

Share on Google Plus

About Ashadullah Shawon

I am Ashadullah Shawon. I am a Software Engineer. I studied Computer Science and Engineering (CSE) at RUET. I Like To Share Knowledge. Learn More: Click Here