HDU1164 Eddy's research I
来源:互联网 发布:淘宝卖家页面生成器 编辑:程序博客网 时间:2024/05/21 12:08
1164
Eddy’s research I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 10194 Accepted Submission(s): 6302
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
Recommend
JGShining | We have carefully selected several similar problems for you: 1215 1286 1211 1299 1222
边判断边处理
#include<stdio.h>#include<math.h>int main(){ int i, n; while (scanf("%d", &n) != EOF) { for (i = 2; i <= (int)sqrt((double)n); i++) { int k = n%i; if(k == 0) { printf("%d*", i); n = n / i; i = 1; } } printf("%d\n", n); } return 0;}
- HDU1164:Eddy's research I
- hdu1164-Eddy's research I
- Eddy\'s research I(HDU1164)
- hdu1164 Eddy's research I
- hdu1164 Eddy's research I
- HDU1164 Eddy's research I
- HDU1164 Eddy's research I
- HDU1164 Eddy's research I
- HDU1164 Eddy's research I
- HDU1164 Eddy's research I
- hdu1164 Eddy's research I
- Eddy's research I(hdu1164分解因数)
- Hdu1164(Eddy's research I 因子分解)
- hdu1164 Eddy's research I(数论:唯一分解式)
- HDU1164:Eddy's research I(素数筛选法)
- HDU1164 Eddy's research I(解法二)
- Eddy's research I
- Eddy's research I
- GCC编译过程
- iOS开发之键盘样式
- Eclipse Class Decompiler——Java反编译插件的安装和使用
- python的josn.dump/dumps和load/loads
- Hive-2.1.1的安装
- HDU1164 Eddy's research I
- 51Nod-1174-区间中最大的数
- 1、SSL证书部署
- exec执行存储过程提示"违反主键约束"
- 关于设计方案
- Node.js ORM框架Sequlize之表间关系
- 滚动数组详解
- 属性 方法 构造器 20170726
- hdu 6035 Colorful Tree