HDU 1164 Eddy's research I
来源:互联网 发布:网络出版的类型 编辑:程序博客网 时间:2024/06/10 23:34
Eddy's research I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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
119412
Sample Output
112*2*13*181
Author
eddy
题意:分解质因数。
CODE:
#include <iostream>#include <cmath>using namespace std;int main(){ int a[105]; int n; while(cin>>n){ int cnt=0; for(int i=2;i<=sqrt(n);i++){ while(n%i==0){ a[cnt++]=i; n/=i; } } if(n!=1) a[cnt++]=n; for(int i=0;i<cnt-1;i++) cout<<a[i]<<'*'; cout<<a[cnt-1]<<endl; }}
0 0
- HDU 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- Hdu 1164-Eddy's research I
- hdu(1164)Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I
- hdu 1164 Eddy's research I
- hdu-1164-Eddy's research I
- hdu-oj 1164 Eddy's research I
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I.doc
- hdu 1164 Eddy's research I
- HDU 1164 Eddy's research I
- node-xlsx使用教程
- Sublime Text 3 快捷键总结
- hive技术简介
- python3.4连接mysql
- Oracle怎创建自增
- HDU 1164 Eddy's research I
- openswan安装配置手册(PSK)
- 程序打包成可执行的jar包
- Linux下安装maven
- 微软平台文件编码兼容Unix不生成BOM头
- Android编程实用小技巧
- Java动态代理详解
- solr报maxClauseCount is set to 1024 的解决方案
- Hibernate – Many-to-Many example (Annotation)