HDU 1164 Eddy's research I（素数连乘）

HDU 1164 Eddy's research I（素数连乘）

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#include#include#include#include#include#include#includetypedef 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;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。