Eddy's research I

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 8381    Accepted Submission(s): 5151


Problem Description

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

 

Input

The input will contain a number 1 < x<= 65535 per line representing the number of elements of the set.

 

Output

You have to print a line in the output for each entry with the answer to the previous question.

 


Sample Input

11 9412


Sample Output

11 2*2*13*181

 

Author

eddy

 


题解：将数分解为素数的连乘。。。


AC代码：


#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<algorithm>
typedef long long LL;
using namespace std;
int prime(int n){
   for(int i=2;i<=sqrt(n);i++){
      if(n%i==0)
      return 0;
      if(i>n)return 1;
   }
}

int main()
{
    int m;
    while(cin>>m){
      if(prime(m)){
         printf("%d\n",m);continue;
      }
      
      for(int i=2;i<=sqrt(m);i++){
         if(m%i==0){
            printf("%d*",i);
            m/=i;
            i=1;
         }
      }
      printf("%d\n",m);
      
    }
         
   return 0;
}