UVA-583 Prime Factors

#include <bits/stdc++.h>
using namespace std;

long long int primefactors(long long int n)
{

    cout<<n<<" =";
    if(n<0)
    {
        cout<<" "<<-1<<" x";
        n=abs(n);

    }

    while(n%2==0)
    {
        if(n==2)
        {
          cout<<" "<<2<<endl;
        }
        else
        {
          cout<<" "<<2<<" x";
        }
        n=n/2;
    }
    for(int i=3;i<=sqrt(n);i=i+2)
    {
        while(n%i==0)
        {
            if(n==i)
            {
               cout<<" "<<i<<endl;
            }
            else
            {
              cout<<" "<<i<<" x";
            }
            n=n/i;
        }
    }
    if(n>2)
    {
        cout<<" "<<n<<endl;
    }
}

int main()
{
    long long int n;
    while(cin>>n)
    {
        if(n==0)
        {
            break;
        }
        primefactors(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