Problem D

最新推荐文章于 2024-02-02 12:58:03 发布

weixin_33969116

最新推荐文章于 2024-02-02 12:58:03 发布

阅读量106

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lengxia/p/4387889.html

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

#include <iostream>

using namespace std;
int main()
{int p(int n);
int n;
while(cin>>n)
{int i,k=0;
n=p(n);
for(i=2;i<n;i++)
if(n%i==0)
{
n=p(n);
i=1;}
cout<<n<<endl;

}

return 0;}

int p(int n)
{int i;
for(i=2;i<n;i++)
if(n%i==0)
{n=n/i;
cout<<i<<"*";
break;
}
return n;
}

转载于:https://www.cnblogs.com/lengxia/p/4387889.html