HDU 1164 Eddy's research I.doc

Problem Description

Eddy's interest is very extensive, recently he isinterested in prime number. Eddy discover the all number owned can be dividedinto the multiply of prime number, but he can't write program, so Eddy has toask intelligent you to help him, he asks you to write a program which can dothe number to divided into the multiply of prime number factor .

Input

The inputwill contain a number 1 < x<= 65535 per line representing the number ofelements of the set.

Output

You have toprint a line in the output for each entry with the answer to the previousquestion.

Sample Input

11

9412

Sample Output

11

2*2*13*181

 

#include <iostream>

#include <math.h>

using namespace std;

int prime(int x)

{

   int k=sqrt(1.0*x),i;

   bool flag=true;

    for(i=2;i<=k;i++)

       if(x%i==0)

       {

         flag=false;

         break;

       }

   return flag;

}

int main()

{

   int x,i;

   while(cin>>x)

    {

       while(x!=1)

       {

           for(i=2;i<=x;i++)

               if(x%i==0)

                    if(prime(i))

                    {

                      x=x/i;

                      if(x==1)

                        {

                           cout<<i<<endl;

                            break;

                        }

                      else

                       cout<<i<<"*";

                      i=1;

                    }

       }

    }

   return 0;

}